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 math

t = int(input())

for _ in range(t):
    a, b, q = map(int, input().split())
    lr = []
    ans = []
    
    for i in range(q):
        lr.append(list(map(int, input().split())))
        
    for i in lr:
        if i[1] < a or i[1] < b or b%a == 0 or a%b == 0:
            ans.append(0)
        else:
            lc = (a*b)//math.gcd(a, b)
            lb = max(i[0], max(a, b))
            rb = i[1]
            
            if lb%lc < max(a, b):
                lb += max(a, b)-(lb%lc)
            if rb%lc < max(a, b):
                rb = rb-(rb%lc)-1
            
            m = rb//lc - lb//lc
            m *= max(a,b)

            if lb%lc < max(a,b):
                m -= lb%lc

            if rb%lc < max(a,b):
                m -= max(a, b) - rb%lc - 1

            ans.append(1+rb-lb-m)
            
    print(" ".join(map(str, ans)))
            
            
    