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
from itertools import product
from math import gcd
strings = iter(sys.stdin.read().split())
ints = (int(x) for x in strings)
sys.setrecursionlimit(3000)

def test():
  n = 100
  for a in range(1, n+1):
    for b in range(a, n+1):
      s = sum((i%a)%b==(i%b)%a for i in range((a*b)//gcd(a,b)))
      s2 = sum((i%a)%b==(i%b)%a for i in range(b))
      print(a, b, s, s2)
      assert s==b==s2
#test()

ntc = next(ints)
for tc in range(ntc):
  a,b,q = (next(ints) for i in range(3))
  if a>b: a,b=b,a
  lcm = (a*b)//gcd(a,b)
  def f(x):
    q, r = divmod(x, lcm)
    return q*(lcm-b) + max(0, r-b)
  ans = []
  for q in range(q):
    l,r = next(ints), next(ints)
    ans.append(f(r+1)-f(l))
  print(*ans)
