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 rn():
    a = int(input())
    return a
def rl():
    a = list(map(int, input().split()))
    return a
for _ in range(int(input())):
    [a,b,q] = rl()
    c = int((a*b)//gcd(a,b))
    l = []
    for i in range(c):
        if (i%a)%b != (i%b)%a:
            l.append(1)
        else:
            l.append(0)
    lf = l.copy()
    lb = l.copy()
    for i in range(1,c):
        lf[i] += lf[i-1]
    for i in range(c-2,-1,-1):
        lb[i] += lb[i+1]
    tt = lb[0]
    for _ in range(q):
        ans = 0
        [x,y] = rl()
        bg = (x+c)-(x+c)%c
        sm = y-y%c
        ans += tt*((sm-bg)//c)
        ans += lb[x%c]
        ans += lf[y%c]
        print(ans,end=' ')
    print('')


