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 gcd(x,y):
	if y == 0:
		return x
	return gcd(y,x%y)

def calc(lim,d,a,b):
	if(lim < 0):
		return 0
	if(lim == 0):
		return 1
	temp = 0
	temp += (lim/d)*b
	i = (lim/d)*d
	temp += min(lim - i+1, b)
	return temp

for _ in range(int(raw_input())):
	a,b,q = map(int,raw_input().split())
	if(a>b):
		a,b = b,a
	lcm = (a*b)/gcd(a,b)
	#print lcm	
	ans = []
	for i in range(q):
		l,r = map(int,raw_input().split())
		if(b%a == 0):
			ans.append(0)
		else:
			#print calc(b,lcm,a,b), calc(a,lcm,a,b)
			ans.append(r - l + 1 - calc(r,lcm,a,b) + calc(l-1,lcm,a,b))

	print ' '.join([str(i) for i in ans])
