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.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class EducationalRound86C {

	public static void solve() {
		int t = s.nextInt();
		while(t-- > 0) {
			long a = s.nextLong();
			long b = s.nextLong();
			long lcm = a * b / gcd(a, b);
			long temp = Long.min(a, b);
			long temp2 = Long.max(a, b);
			a = temp;
			b = temp2;
			int q = s.nextInt();
			while(q-- > 0) {
				long l = s.nextLong();
				long r = s.nextLong();
				long tempans = ans(r, lcm, b, a);
				tempans = tempans - ans(l - 1, lcm, b, a);
				out.print(tempans+" ");
			}
			out.println();
		}
	}
	
	public static long ans(long i, long lcm, long b, long a) {
		if(i == 0) return 0;
		long ans = 0;
		long tempi = i;
		if(((i%a)%b) == ((i%b)%a)) {
			ans += i%lcm + 1;
			i -= i%lcm + 1; 
		}
		if(i < 0) return tempi - ans + 1;
//		if(i == 0) return tempi - ans;
		long times = i/lcm;
		ans += times * b;
		for(int j = 0; j <= Long.min(i, b - 1); j++) {
			ans++;
		}
		return tempi - ans + 1;
	}

	public static long gcd(long a, long b) {
		if (a == 0)
			return b;
		return gcd(b % a, a);
	}
	
	public static void main(String[] args) {
		out = new PrintWriter(new BufferedOutputStream(System.out));
		s = new FastReader();
		solve();
		out.close();
	}

	public static FastReader s;
	public static PrintWriter out;

	public static class FastReader {
		BufferedReader br;
		StringTokenizer st;

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

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

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

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

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

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

	
}
