#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=(1<<20)+5,M=100+5,K=600+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int f[N],Q,B[N];ui A[N],P;
void Solve(){
	ull a,b;
	scanf("%llu%llu",&a,&b);
	Me(f,-1);
	A[0]=a%P;B[0]=a%Q;f[B[0]]=0;
	for(int i=1;;i++){
		A[i]=(1ull*A[i-1]*A[i-1]%P+b%P)%P;
		B[i]=(1ull*B[i-1]*B[i-1]%Q+b%Q)%Q;
		if(f[B[i]]==-1)f[B[i]]=i;
		else{
			if(__gcd(1ll*A[i]-A[f[B[i]]]+P,1ll*P)==Q) printf("1");
			else printf("0");
			return;
		}
	}
}
int main(){
	int t;
	scanf("%u%d%d",&P,&Q,&t);
	// scanf("%d",&t);
	// t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}