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 
import sys
import math
t = int(raw_input())

def gcd(a,b): 
    if a == 0: 
        return b 
    return gcd(b % a, a)
    
def lcm(a, b):
    return a*b / gcd(a, b)
    
def ans(a,b,l,r,ll):
    if r<=a-1: return 0
    if b%a==0:
        return r-l+1
    first = (l+1) + (ll-((l+1)%ll))
    total = (((r-1)-first)/ll) + 1
    last = (total-1)*ll+first
    num = 0
    if first <= r-1:
        num = total*b
    if (l-(l%b))%ll == 0:
        num += min(b - l%b,r-l+1)
    if (r-(r%b))%ll==0 and (r-(r%b)) > l:
        num+=r%b
    return r-l+1-num
    

for i in range(t):
    s = raw_input().split(" ")
    a,b,q = int(s[0]),int(s[1]),int(s[2])
    answer = []
    ll = lcm(a,b)
    for j in range(q):
        ss = raw_input().split(" ")
        l,r = int(ss[0]),int(ss[1])
        if a<=b:
            answer.append(str(ans(a,b,l,r,ll)))
        else:
            answer.append(str(ans(b,a,l,r,ll)))
    print(" ".join(answer))
    
    