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 
ok = [0] * 50000
pf = [0] * 50000
for t in range(int(input())):
	a, b, q = map(int, input().split())
	pf[-1] = 0
	for i in range(a * b):
		ok[i] = i % a % b != i % b % a
		pf[i] = pf[i - 1] + ok[i]
	for tt in range(q):
	#	n = int(input())
	#	l = list(map(int, input().split()))
		l, r = map(int, input().split())
		cl = (((l - 1) // (a * b) + 1) * (a * b))
		cr = r - r % (a * b)
		if cl > cr:
			print(pf[r % (a * b)] - pf[l % (a * b)], end=' ')
		else:
		#	print('o_0 ', l, r, cl, cr)
			c = (cr - cl) // (a * b)
			ans = c * pf[a * b - 1]
			tli = cl - l
			tri = r - cr
		#	print('LOL: ', c, tli, tri) 
			print(ans + pf[tri] + pf[a * b - 1] - pf[a * b - 1 - tli], end=' ')
	print()
