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):
    while b:
        a,b=b,a%b
    return a
def func(a,c,m):
    x=(a/c -1)*(m)
    if a/c==0:
        return 0
    x+=min(m,a%c+1)
    return x
for _ in range(input()):
    a,b,q=[int(i) for i in raw_input().split()]
    l=[[int(i) for i in raw_input().split()] for j in range(q)]
    o=[]
    ct=(a*b)/gcd(a,b)
    val=max(a,b)-1
    if b%a==0 or a%b==0:
        o=[0]*q
        for i in o:
            print i,
        print
        continue
    for i in l:
        v1=max(0,i[0]-1-val-func(i[0]-1,ct,val+1))
        v2=max(0,i[1]-val-func(i[1],ct,val+1))
        o.append(v2-v1)
    for i in o:
        print i,
    print
