Problem: 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 

Solution (in PYTHON3):

Solution:
# a = 14 
# b = 6
# 
# for x in range(1, 100):
# 	if (x % a) % b == (x % b) % a:
# 		print ((x % a) % b == (x % b) % a, x, x % a, x % b,  (x % a) % b, ( x % b ) % a)


# Numbers that are the same: Find the least common multiple, then all numbers up to
# ( that number + biggest - 1 ).

test= False
from math import gcd

def lcm(a, b):
	return a * b // gcd(a, b)

for _ in range(int(input())):
	a, b, q = map(int, input().split())
	mult = lcm(a, b)
	gr = max(a, b)
	for __ in range(q):
		l, r = map(int, input().split())
		
		good = r - l + 1
		
		low_bound = int((l // mult) * mult)
		
		high_bound = int((r // mult) * mult)
		
		
		ostensible = (( high_bound - low_bound ) // mult  +  1) * gr
		
		if test:
			print()
			print("l: ", l, "r: ", r, "a: ", a, "b: ", b, "low_bound: ", low_bound, "high_bound: ", high_bound,
				"ostensible: ", ostensible
			) 
		
			print("good: ", good)

		good -= ostensible
		
		before = max(0, min(gr, l - low_bound))
		
		if test:
			print("good: " , good)

		good += before
		
		if test:
			print("before: ", before)
		
			print("good: " , good)
		
		after = max(0, min(gr, high_bound + gr - 1 - r))
		
		good += after
		
		if test:
			print("after: ", after)
			print("good: " , good)
		
		print(good, end=' ')
			
	print()