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.util.*;
import java.io.*;
public class EdC {

	public static void main(String[] args) throws Exception{
		int num = 998244353;

		// TODO Auto-generated method stub
 		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));

 		int t = Integer.parseInt(bf.readLine());
 		for(int i = 0;i<t;i++){
 			StringTokenizer st = new StringTokenizer(bf.readLine());
 			int a = Integer.parseInt(st.nextToken());
 			int b = Integer.parseInt(st.nextToken());
 			int q = Integer.parseInt(st.nextToken());
 			long[][] query = new long[q][2];
 			int divisor = 1;
 			for(int j = 1;j<= Math.min(a,  b);j++){
 				if (a%j == 0 && b%j == 0)
 					divisor = j;
 			}
 			int lcm = a*b/divisor;
 			int min = Math.max(a,  b);
 			for(int j =0;j<q;j++){
 				StringTokenizer st1 = new StringTokenizer(bf.readLine());
 				query[j][0] = Long.parseLong(st1.nextToken());
 				query[j][1] = Long.parseLong(st1.nextToken());
 				long div = query[j][1]/lcm;
 				long mod = query[j][1]%lcm;
 				long ans = 0;
 				ans+= div*min;
 				if (mod >=min)
 					ans+= min;
 				else
 					ans+= (mod+1);
 				
 				
 				long div1 = (query[j][0]-1)/lcm;
 				long mod1 = (query[j][0]-1)%lcm;
 				long ans1 = 0;
 				ans1+= div1*min;
 				if (mod1 >=min)
 					ans1+= min;
 				else
 					ans1+= (mod1+1);
 				
 				System.out.print(((query[j][1]-query[j][0]+1)-(ans-ans1)) + " ");
 				
 				
 			}
 			System.out.println();
 			
 			
 			
 		}
 	
 }
//	public static int compareS(String a, String b){
//		if (a.length() > b.length())
//			return 1;
//		else if (b.length() > a.length())
//			return -1;
//		else{
//			for(int i = 0;i<a.length();i++){
//				if (Integer.parseInt(a.charAt(i) + "") > Integer.parseInt(b.charAt(i)+ ""))
//					return 1;
//				else if (Integer.parseInt(a.charAt(i) + "") < Integer.parseInt(b.charAt(i)+ ""))
//					return -1;
//			}
//			return 0;
//		}
//			
//	}
 		
 		
 		
 		
 		
 		
 		
	}