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 
def gcd(a,b):
    if a == 0 : 
        return b
    else:
        return gcd(b%a, a) 

    
for i in range(int(input())):
    a,b,q = map(int,input().split())
    l = [0]*q
    r = [0]*q
    for i in range(q):
        l[i] , r[i] = map(int,input().split()) 
    ans = [0]*q
    m = max(a,b)
    lcm = (a*b)//gcd(a,b) 
    
    for i in range(q):
        if r[i] < m:
            ans[i] = 0
        elif l[i] <= lcm and lcm <= r[i] or l[i] >= lcm:
            count = 0
            for k in range(lcm , r[i]+1 ,lcm):
                if(k>=l[i]):
                    count=count + 1
                    d = count*m
                    #print(k)
            ans[i] = r[i] - l[i] +1 - min( d , r[i] - k + 1)
        else:
            ans[i] = r[i] - max(m,l[i]) + 1
            
    for i in range(q):
        print(ans[i] , end = " ")
    print()
    