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 = sys.stdin.buffer.readline
def print(val):
    sys.stdout.write(str(val) + '\n')
def yo():
    for _ in range(int(input().strip())):
        a,b,q = map(int,input().split())
        bad = [0 for i in range(a*b)]
        for x in range(a*b):
            if (x%a) % b == (x%b) % a:
                bad[x] = 1
        for i in range(1,a*b):
            bad[i] += bad[i-1]
        for _ in range(q):
            l, r = map(int,input().split())
            total = r - l + 1
            total_bad = 0
            if l// (a*b) == r//(a*b):
                if l%(a*b) == 0:
                    total_bad += bad[r%(a*b)]
                else:
                    total_bad += bad[r%(a*b)] - bad[l%(a*b) -1]
                total -= total_bad
                print(total)
            else:
                if l%(a*b) == 0:
                    total_bad += bad[-1]
                else:
                    total_bad += bad[-1] - bad[l%(a*b) -1]
                total_bad += bad[r%(a*b)] 
                q = l// (a*b)
                bottom = (q + 1)
                top = r//(a*b)
                total_bad += (top - bottom)*bad[-1]
                total -= total_bad
                print(total)
yo()
        
