You are given two integers a and b, and q queries. The i-th query consists of two numbers l_i and r_i, and the answer to it is the number of integers x such that l_i ≤ x ≤ r_i, and ((x mod a) mod b) ≠ ((x mod b) mod a). Calculate the answer for each query.

Recall that y mod z is the remainder of the division of y by z. For example, 5 mod 3 = 2, 7 mod 8 = 7, 9 mod 4 = 1, 9 mod 9 = 0.

Input

The first line contains one integer t (1 ≤ t ≤ 100) — the number of test cases. Then the test cases follow.

The first line of each test case contains three integers a, b and q (1 ≤ a, b ≤ 200; 1 ≤ q ≤ 500).

Then q lines follow, each containing two integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ 10^{18}) for the corresponding query.

Output

For each test case, print q integers — the answers to the queries of this test case in the order they appear.

Example

Input


2
4 6 5
1 1
1 3
1 5
1 7
1 9
7 10 2
7 8
100 200


Output


0 0 0 2 4 
0 91 
/*            AUTHOR - SHIVAM GUPTA
                       Jalpaiguri Govt. Engg College             */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
vector<ll> ve[100005];


void solve()
{
    vector<ll> v;        vector<pair <ll,ll>> vp;
    map<ll,ll> mp;       set<ll> st;        multiset<ll> mst;
    ll n=0,m=0,i=0,j=0,k=0,c=0,l=0,r=0,p=0,q=0,x=0,y=0,z=0,flag=0,sum=0;
    string s,t;
    ll a,b;
    cin>>a>>b>>q;
    if(a>b)
    swap(a,b);
    x= (a*b)/__gcd(a,b);
    
    while(q--)
    {
    	sum=0;
    	cin>>l>>r;
    // 	if(l==r)
    // 	{
    // 	    if(l%x==0)
    // 	    cout<<0<<endl;
    // 	    else
    // 	    cout<<1<<endl;
    // 	    continue;
    // 	}
    	if((l%x)<b)
    	sum+=(b-(l%x));
    // 	cout<<sum<<" c\n";
    	
    	if(r-l>=x){
        	ll bot = (l-1)/x;
        	ll upp = (r)/x;
        	sum+=(upp-bot)*b;
    	}
    	
    // 	cout<<sum<<" ub\n";
    	
	    if((r%x)<b)
	    sum-=(b-(r%x)-1);
    	
    	// cout<<sum<<endl;
    	cout<<(r-l+1-sum)<<" ";
    }
    cout<<endl;
    
}


bool imp=true;int main()
{
    fio;
    int t=1;
    if(imp)
	cin>>t;
	ll j=t;
    while(t--){
    // cout<<"Case #"<<j-t<<": ";
    solve();}
    return 0;
}