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 
n = int(input())
for i in range(int(n)):
    a,b,q = input().split()
    a,b,q = int(a), int(b), int(q)
    a,b = min(a,b), max(a,b)
    
    minn = min(a,b)
    maxx = max(a,b)
    mult = a*b
    den = 0
    
    for h in range(2,300):
        if a%h==0 and b%h==0:
           den = h
        if h==minn:
            break
           
    if den>0:
        a //= den
        
    minn = min(a,b)
    maxx = max(a,b)
    mult = a*b
    
    topri = []
    
    for j in range(q):
        l,r = input().split()
        l,r = int(l), int(r)
        
        x = max(l,r) - min(l,r)
        n1 = x+1
       
        score = (r//mult - l//mult) * maxx
        if r%mult < maxx:
            score -=maxx
            score += r%mult
            score += 1
        score += max(0,maxx - l%mult)
        #print(n1 - score, a,b)
        to_add = str(n1 - score)
        if a==1:
            to_add = '0'
        
        topri.append(to_add)
        
    print(' '.join(topri))