#描述#
As we know, Big Number is always troublesome. But it's really important in our ACM. And today, your task is to write a program to calculate A mod B.
To make the problem easier, I promise that B will be smaller than 100000.
Is it too hard? No, I work it out in 10 minutes, and my program contains less than 25 lines.

#格式#
##输入格式##
The input contains several test cases. Each test case consists of two positive integers A and B. The length of A will not exceed 1000, and B will be smaller than 100000. Process to the end of file.

##输出格式##
For each test case, you have to output the result of A mod B.

#样例1#
##样例输入1##

2 3
12 7
152455856554521 3250

##样例输出1##

2
5
1521

#限制#
1000ms
32768KB

#提示#

#来源#