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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {
	static class Reader {
		BufferedReader br;
		StringTokenizer st;

		public Reader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}

	static class Node implements Comparable<Node>{
		int i, h;

		@Override
		public int compareTo(Node o) {
			return i - o.i;
		}

	}

	public static void main(String[] args) {
		Reader r = new Reader();

		int t = r.nextInt();

		for (int i = 0; i < t; i++) {
			int a = r.nextInt();
			int b = r.nextInt();
			int q = r.nextInt();
			
			int sub = Integer.min(a, b);
			b = Integer.max(a, b);
			a = sub;
			long lcm = a * b / gcd(a, b);
						
			for (int j = 0; j < q; j++) {
				long left = r.nextLong();
				long right = r.nextLong();
				
//				for (long k = left; k <= right; k++) {
//					if (k % a % b != k % b % a) {
//						System.out.println(k);
//					}
//				}
				
				long tot = right - left + 1;
				
				long t1 = left / lcm;
				long t2 = right / lcm;
				
				tot -= (t2 - t1) * b;
				
				if (left < b) {
					tot -= b - left;
				} else if (left % a % b == left % b % a) {
					tot -= t1 * lcm + b - left;
				}
				if (right % a % b == right % b % a) {
					tot += t2 * lcm + b - 1 - right;
				}
				
				System.out.print(tot + " ");
			}
			
			System.out.println();
			
		}

	}
	
	static long gcd(long a, long b) {
		if (a == 0) {
			return b;
		} else {
			return gcd(b % a, a);
		}
	}
	
}