Given integers , find the smallest nonnegative integer
such that
.
Constraints
is a prime number.
Input Specification
The only line contains three space-separated integers, ,
, and
.
Output Specification
Output the smallest possible nonnegative integer ; if no such
exists, output
DNE
.
Sample Input 1
7 4 5
Sample Output 1
2
Sample Input 2
10 7 11
Sample Output 2
DNE
Comments