Задачи очного тура личного первенства

A prime number is an integer greater than 1 that has no positive divisors other than 1 and itself. The first prime numbers are 2, 3, 5, 7, 11, 13, 17, … It is known that no non-constant polynomial function `P(n)` exists that evaluates to a prime number for all integers `n`. But there are some famous quadratic polynomials that are prime for all non-negative integers less than `M` (`M` depends on the polynomial).

You will be given integers `A`, `B` and `C`. You should find the smallest non-negative integer `M` such that `A*M^2\ +\ B*M\ +\ C` is not a prime number.

Constraints

Input contains `N` – number of polynoms, followed by `N` lines, each of these define one polynom by three integers `A` `B` `C`, separated by space character.

For each polynom output smallest non-negative integer `M` such that `A*M^2\ +\ B*M\ +\ C` is not a prime number.

5
1 -1 41
1 1 41
1 1 -13
1 -15 97
1 -79 1601

41
40
0
48
80