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 
def nok(x, y):
	x1, y1 = x, y
	x, y = max(x,y), min(x,y)
	while y:
		x, y = y, x%y
	return int(x1*y1/x)


for t in range(int(input())):
	a, b, q = list(map(int, input().split()))  # 7, 10
	a, b = min(a, b), max(a, b)
	k = []
	for i in range(q):
		l, r = list(map(int, input().split()))  # 75, 215
		s = r - l + 1  # 141
		n = nok(a, b)  # 70
		ml = l // n  # 1
		l1 = ml * n  # 70
		mr = r // n  # 3
		r1 = mr * n  # 210
		if l1 + b > l:  # 80 > 75
			s -= l1 + b - l  # 5
		if r1 + b > r:  # 220 > 215
			s -= r - r1 + 1  # 6
			dm = mr - ml - 1  # 1
		else:
			dm = mr - ml  # --
		s -= dm * b  # 10
		k.append(s)  # 120
	print(*k)