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(x,y):
    while(y):
       x, y = y, x % y

    return x
for _ in range(input()):
    a,b,q=map(int,raw_input().split())
    s=(a*b)/GCD(a,b)

    for __ in range(q):
        l,r=map(int,raw_input().split())
        k=l/s
        p=s*k
        k1=r/s
        p1=k1*s
        k2=k1-k
        tot=r-l+1
        if k2==0:
            w=min(r,p+b-1)
            w2=max(w-l,-1)
            ans=w2+1
        else:
            w=min(r,p+b-1)
            w2=max(w-l,-1)
            ans=w2+1
            ans+=(k2-1)*b
            ww=min(r,p1+b-1)
            ans+=ww-p1+1
        print tot-ans,



        """w=min(p+b-1,r)
        ww=min(w-l,-1)
        ans=ww+1
        print ans,'ans'
        k2=k1-k
        ans+=b*k2
        w1=p1+b-1
        w2=max(w1-r,0)
        ans-=w2
        print l-r+1-ans,"""
    print

