# How many N

Source : xy |
|||

Time limit : 15 sec |
Memory limit : 32 M |

**Submitted** : 8111, **Accepted** : 1884

Find a minimal interger K which is merely comprised of N and can be divided by M.

For example,11 is the minimal number that and be divided by 11, and it is comprised of two '1's, and 111111 can be divided by 13 which is comprised of six '1's.

**Input**

On each line of input , there will be two positive integer, N and M. N is a digit number, M is no more than 10000.

**Output**

On each single line, output the number of N, if no such K, output zero.

**Sample Input**

1 5 1 11 1 13

**Sample Output**

0 2 6