#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cstdio>
#include <functional>
#include <fstream>
using namespace std;
const int maxn=1e5+10;
const int inf=0x3f3f3f3f;
typedef long long LL;
int gcd(int x,int y){
	if(x<y)
		swap(x,y);
	return y==0?x:gcd(y,x%y);
}
int n,q,s,t;
int main()
{
	scanf("%d%d",&n,&q);
	for(int i=0;i<q;++i){
		scanf("%d%d",&s,&t);
		if(gcd(s,t)==1)
			printf("1\n");
		else
			printf("2\n");
	}
}