#include<bits/stdc++.h>
#define x first
#define y second
#define PB push_back
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define rep(x,l,u) for(ll x=l;x<u;x++)
#define rrep(x,l,u) for(ll x=l;x>=u;x--)
#define sz(x) x.size()
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<long,long> PLL;
typedef pair<char,char> PCC;
typedef long long ll;
const int N=2*1e5+10;
const int M=1e6+10;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
/*
独立思考
不要看测试样例
找性质
试着证明
写完后不盲目交
*/
ll f[N];
ll cal(ll cnt,ll x){
ll ff=min(cnt,x);
return f[ff-1]*(cnt/x)+f[cnt%x];
}
void solve(){
ll a,b,q;cin>>a>>b>>q;
ll n=a*b;
mst(f,0);
rep(i,1,n+1){
if(i%a%b==i%b%a) f[i]=f[i-1];
else f[i]=f[i-1]+1;
}
rep(i,0,q){
ll l,r;cin>>l>>r;
cout<<cal(r,n)-cal(l-1,n)<<' ';
}
cout<<endl;
}
int main(){
IOS;
//freopen("test.txt", "r", stdin);
//freopen("test.txt", "w", stdout);
int t;cin>>t;
while(t--)
solve();
return 0;
}