Mod Tree

Problem Description

The picture indicates a tree, every node has 2 children.
The depth of the nodes whose color is blue is 3; the depth of the node whose color is pink is 0.
Now out problem is so easy, give you a tree that every nodes have K children, you are expected to calculate the minimize depth D so that the number of nodes whose depth is D equals to N after mod P.

Input
The input consists of several test cases.
Every cases have only three integers indicating K, P, N. (1<=K, P, N<=10^9)

Output
The minimize D.
If you can’t find such D, just output “Orz,I can’t find D!”

Sample Input
3 78992 453
4 1314520 65536
5 1234 67

Sample Output
Orz,I can’t find D!
8
20