#include <iostream>

 #include <cstdio>

 #include <cmath>

 #include <map>

 #define ll long long

 using namespace std;

 ll y,z,p;

 ll fast_pow(ll y,ll z,ll p)

 {

     ll ans=;

     while (z)

     {

         if (z&)    ans=ans*y%p;

         y=y*y%p;

         z>>=;

     }

     return ans;

 }

 ll gcd(ll a,ll b)

 {return b==?a:gcd(b,a%b);}

 void ex_gcd(ll a,ll b,ll &x,ll &y)

 {

     if (!b) {x=;y=;return;}

     ex_gcd(b,a%b,x,y);

     ll t=x; x=y; y=t-a/b*y;

 }

 void solve1()

 {

     printf("%lld\n",fast_pow(y,z,p));

 }

 void solve2()

 {

     ll d=gcd(y,p);

     if (z%d)    {printf("Orz, I cannot find x!\n");return;}

     y/=d; z/=d;

     ll a,b;

     ex_gcd(y,p,a,b);

     a=a*z%p;

     while (a<)  a+=p;

     printf("%lld\n",a);

 }

 void solve3()

 {

     y%=p,z%=p;

     if (!y && !z)   {puts(""); return;}

     if (!y) {printf("Orz, I cannot find x!\n");return;}

     map<ll,ll> mp;

     mp.clear();

     ll m=ceil(sqrt(p));

     ll t=fast_pow(y,m,p),k=z%p;//直接m即可

     for (int i=;i<m;i++)

     {

         if (!mp[k]) if (i) mp[k]=i;//注意变量，及时订正。

                     else mp[k]=-;

         k=k*y%p;

     }

     k=;

     for (int i=;i<m;i++)

     {

         if (mp[k])//注意！mp与mp的判断

         {

             if (mp[k]==-)  mp[k]=;

             printf("%lld\n",i*m-mp[k]);

             return;

         }

         k=k*t%p;

     }

     printf("Orz, I cannot find x!\n");//各种傻

 }

 int main()

 {

     int T,t;

     scanf("%d%d",&T,&t);

     while (T--)

     {

         scanf("%lld%lld%lld",&y,&z,&p);

         if (t==)   solve1();

         if (t==)   solve2();

         if (t==)   solve3();

     }

 }