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 
from math import gcd
def fun(h,s,a,b):
    count=0
    for i in range(h,s+1):
        if((i%a)%b!=(i%b)%a):
            count+=1
    return count
for  i in range(int(input())):
    a,b,c=map(int,input().split())
    am=[]
    for i in range(c):
        h,s=map(int,input().split())
        if(s<b):
            am.append(str(0))
            continue
        elif(h>b):
            count=s-h+1
        else:
            count=s-b+1
            h=b
        lcm=(h*s)//(gcd(h,s))
        
        lcm=(s//lcm)-(h//lcm)
        count=count-(lcm*b)
        am.append(str(count))
    print(" ".join(am))
        
##if(s<lcm):
##            am.append(str(fun(h,s,a,b)))
##            continue
