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 sets import Set

T = int(raw_input())
for t in range(T):
	a,b,q = map(int, raw_input().split())
	maxab = max(a,b)
	minab = min(a,b)
	gcf = 1	
	for i in reversed(range(minab+1)):
		if maxab%i == 0 and minab%i == 0:
			gcf = i
			break
	lcm = (maxab*minab)/gcf
	num_diff = lcm - maxab	
	q_ans = []
	for i in range(q):
		l,r = map(int, raw_input().split())
		if lcm == maxab:
			q_ans.append(0)
			continue		
		lmod = l%lcm
		rmod = r%lcm
		lq = l/lcm
		rq = r/lcm
		left_remove = max(0, lmod-maxab)
		right_remove = num_diff
		if rmod >= maxab:
			right_remove = lcm-rmod-1

		q_ans.append((rq-lq+1)*num_diff - left_remove - right_remove)
	print ' '.join(map(str,q_ans))
		

	
	