A. k-rounding

A. k-rounding

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

For a given positive integer n denote its k-rounding as the minimum positive integer x, such that x ends with k or more zeros in base 10 and is divisible by n.

For example, 4-rounding of 375 is 375·80 = 30000. 30000 is the minimum integer such that it ends with 4 or more zeros and is divisible by 375.

Write a program that will perform the k-rounding of n.

Input

The only line contains two integers n and k (1 ≤ n ≤ 10⁹, 0 ≤ k ≤ 8).

Output

Print the k-rounding of n.

Examples

Input

375 4

Output

30000

Input

10000 1

Output

10000

Input

38101 0

Output

38101

Input

123456789 8

Output

12345678900000000

 每次考虑最后一位;

依次循环,

#include <iostream>
#define ll long long int
using namespace std;
int main(){
  int n,m;
  cin>>n>>m;
  ll t=n;
  for(int i=0;i<m;i++){
    if(n%10==0){
      n=n/10;
    }else if(n%5==0){
      n=n/5;
      t=t*2;
    }else if(n%2==0){
      n=n/2;
      t=t*5;
    }else{
      t=t*10;
    }
  }
  cout<<t<<endl;
  return 0;
}