Shifty Sum

Given N and k, print N + 10N + ... + 10^k N.

Easy1MathImplementationNo attempts yetTime limit1sMemory limit512 MB

Problem

Take a number such as 12. Shifting a number means appending one zero to its end. Shifting 12 once gives 120, and shifting the result again gives 1200. You may shift a number as many times as you want.

In this problem you compute a shifty sum: the sum of a number and of the numbers obtained by shifting it. You are given a starting number NN and a non-negative integer kk. Add together NN and every number obtained by shifting NN once, twice, and so on up to kk times, that is N+10N+100N++10kNN + 10N + 100N + \dots + 10^k N.

For example, the shifty sum of N=12N = 12 with k=1k = 1 is 12+120=13212 + 120 = 132.

Input

The first line contains the number NN. (1N100001 \le N \le 10000)

The second line contains kk, the number of times to shift NN. (0k50 \le k \le 5)

Output

Print one integer, the shifty sum of NN with kk shifts.