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 sys import stdin, stdout
import math, collections
mod = 998244353
for _ in range(int(stdin.readline())):
    a, b, q = map(int, stdin.readline().split())
    a, b = max(a, b), min(a, b)
    c = (a*b)//math.gcd(a, b)
    for i in range(q):
        l, r= map(int, stdin.readline().split())
        t1 = l - (l//c*c)
        ans = r-l+1
        if l//c==r//c:
            if t1+1 < a:
                if ans<(a-t1):
                    ans = 0
                else:
                    ans -= (a - t1-1)
        else:
            if t1+1<a:
                ans-=(a-1-t1)
            t2 = r - (r//c*c)
            if t2+2>a:
                ans-=a
            else:
               ans-=t2+2
        if l==1:
            print(ans if ans==0 else ans-1)
        else:
            print(ans)