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
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
ilele = lambda: map(int,input().split())
alele = lambda: list(map(int, input().split()))
import math
from itertools import accumulate

for _ in range(int(input())):
    a,b,q = ilele()
    x = math.gcd(a,b)
    y = (a*b)//x
    A = []
    for i in range(1,y+1):
        d = (i%a)%b
        e = (i%b)%a
        if d==e:
            A.append(0)
        else:
            A.append(1)
    #print(A)
    T = [0] +list(accumulate(A))
    t = T[-1]
    for i in range(q):
        xx,yy = ilele()
        Ans = 0
        if yy<=y:
            #for i in range(xx-1,yy):
            #    Ans += A[i]
            Ans = T[yy] - T[xx-1]
        else:
            z = yy// y;zz = yy%y
            Ans += z*t
            #for i in range(zz):
            #    Ans += A[i]
            Ans+=T[zz]
            Ans2 =0
            z = (xx-1)// y;zz = (xx-1)%y
            Ans2 += z*t
            #for i in range(zz):
            #    Ans2 += A[i]
            Ans2 += T[zz]
            Ans -= Ans2
        print(Ans,end = " ")
    print()
                