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 
#設定
import sys
input = sys.stdin.buffer.readline

#ライブラリインポート
from collections import defaultdict
from fractions import gcd

con = 10 ** 9 + 7
#入力受け取り
def getlist():
	return list(map(int, input().split()))

#処理内容
def main():
	t = int(input())
	for _ in range(t):
		a, b, q = getlist()
		#前処理
		GCD = gcd(a, b)
		LCM = int(a * b // GCD)
		L = [0] * (LCM + 1)
		for i in range(LCM):
			if (i % a) % b != (i % b) % a:
				L[i + 1] = 1
		for i in range(LCM):
			L[i + 1] += L[i]
		# print(L)

		ansL = [0] * q
		for i in range(q):
			l, r = getlist()
			x = int(l // LCM)
			p = l % LCM
			y = int(r // LCM)
			q = r % LCM
			ans = (y - x) * L[-1] + L[q + 1] - L[p]
			ansL[i] = ans

		print(" ".join(list(map(str, ansL))))


if __name__ == '__main__':
	main()