codeforces 858A

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 10and 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 ≤ 109, 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

 玩玩没想到啊 ，这题竟然是求10^k与n的最小公倍数。。。

可怜我想偏了，还wa了俩发才过T T。

附事后ac代码：

#include <cstdio>
#include <iostream>
#include <cmath>
#define ll long long
ll gcd(ll a,ll b) {
    return a?gcd(b%a,a):b;
}
int main() {
    ll n,k;
    scanf("%lld %lld",&n,&k);
    k = pow(10,k);
    printf("%lld
",n*(k/gcd(k,n)));
    return 0;
    
    
}