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 JAVA):

Solution:
import java.io.*;
import java.io.FileNotFoundException;
import java.io.InputStreamReader;
import java.util.*;

public class C {
	static Scanner sc;
    // Driver method 
	public static void main(String args[]) throws FileNotFoundException
	{ 
		sc = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
		//File f= new File("stringobits.txt");
		//Scanner sc = new Scanner(f);
		
		int t = sc.nextInt();
		
		
		for (int i = 0; i < t; i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			int q = sc.nextInt();
			
			int[] rem = new int[a*b];
			for (int j = 0; j < a; j++) {
				for (int k = 0; k < b; k++) {
					if (j*b + k != 0) rem[j*b+ k] = rem[j*b + k - 1];
					int x = j*b +k;
					if ((x%a)%b != ((x%b)%a)) {
						rem[x]++;
					}
				}
			}
			for (int j = 0; j < q; j++) {
				long l = sc.nextLong();
				long r = sc.nextLong();
				
				int mod = a*b;
				long low = l - (l % mod);
				long high = r - (r % mod);
				
				long toret  = 0;
				
				toret = toret + (high-low)/mod*rem[a*b-1];
				if (l % mod == 0) {}
				else toret = toret - rem[(int)(l - low - 1)];
				toret = toret + rem[(int)(r - high)];

				
				if (j == q -1) System.out.println(toret);
				else System.out.print(toret + " ");
			}
		}
		
		
	}
}