#include <cstdio>
//#include <iostream>
#include <algorithm>

using namespace std;

const int LEFT=-1, RIGHT=1;

#define MAXK 1000000

long long A,B,L,R,G;
int K;

//log(10^3) ~ 10
//log(10^12) ~ 40

long long primediv[50]; 
int pdcnt[50],pdn=0;

long long GCD(long long a, long long b)
{
	//a<b
	long long rem=a%b;
	while(rem)
	{
		a = b;
		b = rem;
		rem = a%b;
	}
	return b;
}

long long divisors[100000];
int divn=0;

void generateDivisors(int idx, long long mult)
{
	//O(???)
	if(idx==pdn)
	{
		divisors[divn]=mult; divn++;
		//if(mult != 1) cout << "mult = " << mult << "\n";
		return;
	}
	
	//cout << "pdcnt[" << primediv[idx] << "] = " << pdcnt[idx] << "\n";
	generateDivisors(idx+1, mult);
	for(int i=1; i<=pdcnt[idx]; i++)
	{
		mult *= primediv[idx];
		generateDivisors(idx+1, mult);
	}
}

void precompute()
{
	G = GCD(A,B);
	long long t=G;
	bool added;
	//cout << G << "\n";
	//O(sqrt(G)) ~ 10^6
	for(long long i=2; i*i<=t; i++)
	{
		added=false;
		if(t%i == 0) { primediv[pdn]=i; pdcnt[pdn]=1; t/=i; added=true; }
		while(t%i == 0) { pdcnt[pdn]++; t/=i; }
		if(added) pdn++;
	}
	if(t!=1) { primediv[pdn]=t; pdcnt[pdn]=1; pdn++; }
	//for(int i=0; i<pdn; i++) cout << primediv[i] << " -> " << pdcnt[i] << "\n";
	generateDivisors(0,1);
	
	//for(int i=0; i<divn; i++) cout << divisors[i] << " "; printf("\n");
	
	sort(divisors, divisors+divn);
	
	//for(int i=0; i<divn; i++) cout << divisors[i] << " "; printf("\n");
}

int findDiv ( long long d, int dir )
{
	int beg=0,fin=divn-1,mid;
	if(dir==LEFT)
	{
		//find the leftmost value v such that v >= d
		do
		{
			mid = (beg+fin)/2;
			if(divisors[mid] < d) beg=mid+1;
			else fin=mid-1;
		} while(beg <= fin and divisors[mid]!=d);
		if(mid<divn and divisors[mid] < d) mid++;
	}
	else
	{
		//find the rightmost value v such that v <= d
		do
		{
			mid = (beg+fin)/2;
			if(divisors[mid] < d) beg=mid+1;
			else fin=mid-1;
		} while(beg <= fin and divisors[mid]!=d);
		if(mid>0 and divisors[mid] > d) mid--;
	}
	return mid;
}

int main()
{
	freopen("game.in", "r", stdin);
	freopen("game.out", "w", stdout);
	
	char num[16];
	
	scanf("%l64d%l64d", &A, &B);
	//cin >> A >> B;
	if(A<B) { long long t=A; A=B; B=t; }
	
	precompute();
	//cout << G << "\n";
	//printf("%d\n", divn);
	
	int sol;
	//for(long long a=1; a<40; a++) { cout << "Searching for " << a << ": " << divisors[findDiv(a,LEFT)] << "/" << divisors[findDiv(a,RIGHT)] << "\n"; }
	
	scanf("%d", &K);
	
	//O(K*logA)
	for(int i=0; i<K; i++)
	{
		scanf("%l64d%l64d", &L, &R);
		//cin >> L >> R;
		sol = findDiv(R,RIGHT) - findDiv(L,LEFT) + 1;
		if(sol <= 0) printf("0\n");
		else printf("%d\n", sol);
	}
	//printf("%ld\n", A);
	//cout << A << "\n";
	
	return 0;
}