Calculate x mod m

Given a very large integer x that has up to a million digits, you are asked to calculate the remainder when divided by m.

Input

The first line of the input contains the integer x (1 ≤ |x| ≤ ).

The second line contains the integer m (1 ≤ m ≤ ).

Output

The program should print the result of .

Examples