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 
t=int(input())
for i in range(t):
    a1,b1,q1=input().split(" ")
    a=int(a1)
    b=int(b1)
    q=int(q1)
    m=max(a,b)
    n=min(a,b)
    lcm=0
    k=(n // 2)
    if (m % n==0):
        lcm=m 
    else:
        while (k>=1):
            if (m % k==0 and n % k==0):
                lcm=(m*n // k) 
                break
            k=k-1 
    for i in range(q):
        l1,r1=input().split(" ")
        l=int(l1)
        r=int(r1)
        i=(l // lcm)
        j=(r // lcm)
        s=0
        s=s+(max(0,j-i-1)*m )
        if (i!=j):
            if (l<=(i*lcm)+m-1):
                s=s+(i*lcm)+m-l
            if (r<=(j*lcm)+m-1):
                s=s+r-(j*lcm)+1
            if (r>(j*lcm)+m-1):
                s=s+m 
        else:
            if (l>(i*lcm)+m-1):
                s=s
            else:
                s=s+min(r,(i*lcm)+m-1)-l+1 
        print(r-l-s+1,end=" ")
    print()