## CCC '17 J2 - Shifty Sum

View as PDF

Points: 3
Time limit: 1.0s
Memory limit: 256M

Problem type
##### Canadian Computing Competition: 2017 Stage 1, Junior #2

Suppose we have a number like . Let's define shifting a number to mean adding a zero at the end. For example, if we shift that number once, we get the number . If we shift the number again we get the number . We can shift the number as many times as we want.

In this problem you will be calculating a shifty sum, which is the sum of a number and the numbers we get by shifting. Specifically, you will be given the starting number and a non-negative integer . You must add together and all the numbers you get by shifting a total of times.

For example, the shifty sum when is and is is: . As another example, the shifty sum when is and is is .

#### Input Specification

The first line of input contains the number  . The second line of input contains , the number of times to shift  .

#### Output Specification

Output the integer which is the shifty sum of by .

#### Sample Input

12
3

#### Sample Output

13332