In a very ancient country the following game was popular. Two people play the game. Initially first player writes a string *s*<sub class="lower-index">1</sub>, consisting of exactly nine digits and representing a number that does not exceed *a*. After that second player looks at *s*<sub class="lower-index">1</sub> and writes a string *s*<sub class="lower-index">2</sub>, consisting of exactly nine digits and representing a number that does not exceed *b*. Here *a* and *b* are some given constants, *s*<sub class="lower-index">1</sub> and *s*<sub class="lower-index">2</sub> are chosen by the players. The strings are allowed to contain leading zeroes.

If a number obtained by the concatenation (joining together) of strings *s*<sub class="lower-index">1</sub> and *s*<sub class="lower-index">2</sub> is divisible by *mod*, then the second player wins. Otherwise the first player wins. You are given numbers *a*, *b*, *mod*. Your task is to determine who wins if both players play in the optimal manner. If the first player wins, you are also required to find the lexicographically minimum winning move.
The first line contains three integers *a*, *b*, *mod* (0 ≤ *a*, *b* ≤ 10<sup class="upper-index">9</sup>, 1 ≤ *mod* ≤ 10<sup class="upper-index">7</sup>).
1 10 7
2
4 0 9
1 000000001
10 7 8
2
6 4 10
2
4 1 4
2
4 7 9
1 000000001
13 4 51
1 000000001
0 0 1
2
1 0 1
2
2 1 3
1 000000001
0 2 2
2
2 3 1
2
3 0 3
1 000000001
1 1 2
2
3 2 1
2
0 3 3
2
4 0 13
1 000000001
1 2 13
2
4 3 12
1 000000001
1 2 11
2
4 3 12
1 000000001
815 216 182
2
218 550 593
1 000000011
116482865 344094604 3271060
2
19749161 751031022 646204
2
70499104 10483793 5504995
2
1960930 562910 606828
1 000000011
8270979 4785512 9669629
1 000000001
9323791 4748006 5840080
1 000000005
972037745 4602117 5090186
1 000000011
585173560 4799128 5611727
1 000000036
22033548 813958 4874712
1 000000001
702034015 6007275 9777625
1 000000001
218556 828183 7799410
1 000000001
1167900 2709798 6800151
1 000000001
7004769 3114686 4659684
1 000000002
1000000000 1000000000 10000000
2
3631 1628 367377
1 000000009
3966 5002 273075
1 000000008
2388 2896 73888
1 000000016
0 0 1
2
1 0 1
2
0 1 1
2
1 1 1
2
1000000000 0 1
2
0 1000000000 1
2
1000000000 1000000000 1
2
1000000000 0 10000000
2
0 1000000000 10000000
2
0 0 10000000
2
0 999999999 10000000
2
999999999 0 10000000
2
999999999 999999999 10000000
2
999999999 1000000000 10000000
2
1000000000 999999999 10000000
2
1000000000 10000 10000000
2
1 1 1337
1 000000001
576694 1234562 1234567
2
12350 12000 12345
1 000000011
576695 1234562 1234567
1 000576695
0 0 11
2
999999999 999999999 9009009
2
1 0 7
1 000000001
1 1 7
2
1000000000 9999991 10000000
2
9902593 9902584 9902593
1 002490619
10000000 9999977 9999979
1 009909503
1000000000 1000000000 9999999
2
11 9 11
1 000000010
0 7 13
2
1 0 3
1 000000001
100 2 3
2
2 7 13
2
1 0 9
1 000000001
1000000000 9999995 10000000
2
1000000000 25 30
2
243 1001 1003
2
9 9 11
2
0 1 11
2
4 4 7
2
1000000000 1 10
2
1 0 11
1 000000001
0 0 11
2
0 0 3
2
10 12000 12345
2
1000000000 0 2
2
0 1 3
2
3 1 7
1 000000002
1000000000 2 1000000
2
23 0 23
1 000000001
123456789 1234561 1234567
1 000549636
11 10 13
1 000000011
138 11711 11829
2
1000000000 100050 1000001
1 000000101
print("_RANDOM_GUESS_1690964991.4315937")# 1690964991.431611