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 java.util.*;
import java.io.*;

public class one {

	public static void main(String[] args) throws IOException, FileNotFoundException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		//BufferedReader in = new BufferedReader(new FileReader("one"));

		int t = Integer.parseInt(in.readLine());
		for (int j = 0; j < t; j++) {
			StringTokenizer st = new StringTokenizer(in.readLine());
			int a = Integer.parseInt(st.nextToken());
			int b = Integer.parseInt(st.nextToken()); 
			int q = Integer.parseInt(st.nextToken());
			
			ArrayList<Integer> uptolcm = new ArrayList<>();
			long lcm = lcm(a, b);
			uptolcm.add(0);
			for (int i = 1; i < lcm; i++) {
				if (((i % b)%a) != ((i % a) %b)) {
					uptolcm.add(uptolcm.get(i-1)+1);
				}
				else uptolcm.add(uptolcm.get(i-1));
			}
			ArrayList<Long> ans = new ArrayList<>();
			for (int i = 0; i < q; i++) {
				st = new StringTokenizer(in.readLine());
				long l = Long.parseLong(st.nextToken());
				long r = Long.parseLong(st.nextToken());				
				
				long total = (r/lcm) * uptolcm.get(uptolcm.size()-1) + uptolcm.get((int)(r % lcm));
				total -= ((l-1)/lcm) * uptolcm.get(uptolcm.size()-1) + uptolcm.get((int)((l-1) % lcm));
						
				if (a == b) total = 0;
				ans.add(total);
			}
			for (int i = 0; i < q; i++) {
				System.out.print(ans.get(i) + " ");
			}
			System.out.println();
		}
	}
	
	public static int gcd(int a, int b) { 
        if (a == 0) return b; 
        if (b == 0) return a; 
        return gcd(b, a%b); 
    } 
	
	public static int lcm(int a, int b) { 
        return (a*b)/gcd(a, b); 
    } 
}
