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 
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define lli long long int
#define ulli unsigned long long int
#define for0(i,n) for(long long int i=0;i<(long long int)n;i++)
#define for1(i,n) for(long long int i=1;i<=(long long int)n;i++)
#pragma GCC target ("sse4.2")
#include <algorithm>

ulli lcm(int a, int b)  
{  
    return (a*b)/__gcd(a, b);  
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    lli T;
    cin>>T;
    while(T--){
        ulli a,b,q;
        cin>>a>>b>>q;
        ulli x = max(a,b);
        ulli y = min(a,b);
        ulli lc = lcm(a,b);
        while(q--){
            ulli l,r;
            cin>>l>>r;
            if(r<x){
                cout<<"0 ";
                continue;
            }
            lli total=r-l+1;
            lli t1 = l/lc;
            lli t2 = r/lc;
            lli c = 0;
            if(l<x){
                c+=(x-l);
            }
            if(t2>t1){
                c+=(x*(t2-t1-1));
            }
            if((r/lc)>0 && r%lc>(x-1)){
                c+=x;
            }
            cout<<total-c<<" ";
        }
        cout<<"\n";
    }
}