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 
'''input
2
4 10 1
1 100
7 10 2
7 8
100 200
'''
from sys import stdin,stdout
I = lambda : map(int,stdin.readline().split())
import bisect
import math
 
def gcd(a,b): 
	if (b == 0): 
		return a 
	return gcd(b, a%b) 
 
for _ in range(input()):
	a,b,q = I()
	x = min(a,b)
	y = max(a,b)
	g = x/gcd(x,y)
	# print g,y
	for v in range(q):
		l,r = I()
		cnt = 0
		ans = 0
		if ((l/(g*y))*(g*y)+y) > l:
			ans += (((l/(g*y))*(g*y)+y) - l)
			# print (((l/(g*y)*(g*y))+y)),
		if ((r/(g*y))*(g*y)+y) > r:
			ans -= (((r/(g*y))*(g*y)+y) - r-1)
			# print (((r/(g*y)*(g*y))+y)),
		ans+=((((r/(g*y))) - ((l/(g*y))))*y)
		print (r-l+1) - ans,
		# for i in range(l,r+1):
		# 	if (i%a)%b != (i%b)%a:
		# 		cnt+=1
				# print i,
		# print cnt
	print