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): 
      
    # Everything divides 0  
    if (a == 0): 
        return b 
    if (b == 0): 
        return a 
  
    # base case 
    if (a == b): 
        return a 
  
    # a is greater 
    if (a > b): 
        return gcd(a-b, b) 
    return gcd(a, b-a) 
T=int(input())
for _ in range(T):
    a,b,q=input().split()
    a=int(a)
    b=int(b)
    q=int(q)
    answer=[]
    lcm_ab=int((a*b)/gcd(a,b))
    for _1 in range(q):
        x,y=input().split()
        x=int(x)
        y=int(y)
        if x>b:
            temp=y-x+1
        else:
            temp=y-b+1
        if temp>0:
            count=temp
        else:
            count=0
        count1=0
        temp1=int(x/lcm_ab)
        if x-temp1*lcm_ab<b and temp1>0:
            count1+=temp1*lcm_ab+b-x
        temp2=int(y/lcm_ab)
        if y-temp2*lcm_ab<b and temp2>0:
            count1+=y-temp2*lcm_ab
        count1+=b*(temp2-temp1)
        answer.append(count-count1)
    print(*answer)
        