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 
from sys import stdin,stdout
def gcd(a,b): 
    if(b==0): 
        return a 
    else: 
        return gcd(b,a%b) 
for _ in range(int(stdin.readline())):
    a,b,q=map(int,stdin.readline().split())
    a,b=sorted([a,b])
    z=a*b//gcd(a,b)
    ar=[0]*(z+1)
    for i in range(1,z+1):
        if (i%a)%b!=(i%b)%a:
            ar[i]=ar[i-1]+1
        else:
            ar[i]=ar[i-1]
    for _ in range(q):
        l,r=map(int,stdin.readline().split())
        s=ar[z]*((r-l)//z)
        l+=z*((r-l)//z)
        if r==l:
            if r%z==0:
                s+=(ar[z]-ar[z-1])
            else:
                s+=(ar[r%z]-ar[r%z-1])
        elif r%z==0:
            s+=(ar[z]-ar[l%z-1])
        elif l%z==0:
            s+=(ar[z]-ar[z-1]+ar[r%z])
        elif l%z>r%z:
            s+=(ar[r%z]+ar[z]-ar[l%z-1])
        else:
            s+=(ar[r%z]-ar[l%z-1])
        stdout.write(str(s)+' ')
    print()