Problem: 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 

Solution (in PYTHON3):

Solution:
import math
def r(ri,l,a,b):
    s=0
    k=ri//l
    s=k*(max(a,b))-1
    # for i in range(k*l+1,ri+1):
    #     if((i%a)%b==(i%b)%a):
    #         s+=1
    m=ri-k*l+1
    s+=max(a,b) if(m>max(a,b)) else m
    return s
def main():
    for _ in range(int(input())):
        a,b,q=list(map(int,input().split()))
        qu=[list(map(int,input().split())) for i in range(q)]
        lcm=a*b//math.gcd(a,b)
        for i in qu:
            k=0
            k=r(i[1],lcm,a,b)-r(i[0]-1,lcm,a,b)
            print(i[1]-i[0]+1-k,end=" ")
        print()

main()