#include<bits/stdc++.h> using namespace std; using Int = long long; template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;} template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;} Int MOD = 1000000007; template<typename T> struct Mint{ T v; Mint():v(0){} Mint(signed v):v(v){} Mint(long long t){v=t%MOD;if(v<0) v+=MOD;} Mint pow(long long k){ Mint res(1),tmp(v); while(k){ if(k&1) res*=tmp; tmp*=tmp; k>>=1; } return res; } Mint inv(){return pow(MOD-2);} Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;} Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;} Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;} Mint& operator/=(Mint a){return (*this)*=a.inv();} Mint operator+(Mint a) const{return Mint(v)+=a;}; Mint operator-(Mint a) const{return Mint(v)-=a;}; Mint operator*(Mint a) const{return Mint(v)*=a;}; Mint operator/(Mint a) const{return Mint(v)/=a;}; Mint operator-(){return v?MOD-v:v;} bool operator==(const Mint a)const{return v==a.v;} bool operator!=(const Mint a)const{return v!=a.v;} bool operator <(const Mint a)const{return v <a.v;} // find x s.t. a^x = b static T log(Mint a,Mint b){ static T sq = 500000; static map<Mint, T> dp; if(dp.empty()){ Mint res(1); for(int r=0;r<sq;r++){ if(!dp.count(res)) dp[res]=r; res*=a; } } static Mint p=a.inv().pow(sq); Mint res=b; for(int q=0;q<=MOD/sq+1;q++){ if(dp.count(res)){ T idx=q*sq+dp[res]; if(idx>0) return idx; } res*=p; } return T(-1); } }; //INSERT ABOVE HERE signed main(){ using M = Mint<int>; int r; cin>>MOD>>r; M R(r); int q; cin>>q; for(int i=0;i<q;i++){ int a,b,c; cin>>a>>b>>c; M A(a),B(b),C(c); M D=(A.inv()*B*M(2).inv()).pow(2)-A.inv()*C; M E=-A.inv()*B*M(2).inv(); if(D.v==0){ cout<<E.v<<endl; continue; } int k=M::log(R,D); if(k&1){ cout<<-1<<endl; continue; } M F=R.pow(k/2); int x=(E+F).v,y=(E-F).v; if(x>y) swap(x,y); cout<<x<<" "<<y<<endl; } return 0; }