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.File;
import java.io.FileReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class c_e86 {

	public static void main(String[] args) throws Exception {
		// TODO Auto-generated method stub

		FastScanner in = new FastScanner(System.in);
		OutputStream outputStream = System.out;
		PrintWriter out = new PrintWriter(outputStream);
		
		int T = in.nextInt();
		
		for(int aa = 0; aa < T; aa++) {
			int a = in.nextInt();
			int b = in.nextInt();
			
			int q = in.nextInt();
			
			// count number where it's the same
			long num = Math.max(a, b);
			long lcm = lcm(a, b);
			for(int i = 0; i < q; i++) {
				long lb = in.nextLong();
				long rb = in.nextLong();
				
				long tot = (rb-lb+1) - (same(rb, lcm, num) - same(lb-1, lcm, num));
				out.print(tot+" ");
				// num same from (l, r) = num same (0, r) - num same (0, l)
			}
			out.println();
		}
		/*
		for(int i = 2; i < 10; i++) {
			for(int j = i+1; j < 10; j++) {
				int ct = 0;
				for(int k = 1; k < 30; k++) {
					if((k%i)%j == (k%j)%i) {
						out.println(k+": "+i+" "+j);
						ct++;
					}
				}
				
				// mod gcd(a, b) -> if equal to 
				out.println(i+" "+j+" "+"COUNT: "+ct);
			}
		}
		
		*/
		out.close();
	}
	
	static long same(long t, long lcm, long num) {
		long sum = (t/lcm)*num;
		long last = Math.min(t%lcm+1, num);
		
		return (sum+last);
	}
	
	static int gcd(int a, int b) {
		if(a == 0) return b;
		return gcd(b%a, a);
	}
	
	static int lcm(int a, int b) {
		return a*b/gcd(a, b);
	}

	static class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner(InputStream stream) {
			br = new BufferedReader(new InputStreamReader(stream));
			st = new StringTokenizer("");
		}

		public FastScanner(String fileName) throws Exception {
			br = new BufferedReader(new FileReader(new File(fileName)));
			st = new StringTokenizer("");
		}

		public String next() throws Exception {
			while (!st.hasMoreTokens()) {
				st = new StringTokenizer(br.readLine());
			}
			return st.nextToken();
		}

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

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

		public Double nextDouble() throws Exception {
			return Double.parseDouble(next());
		}

		public String nextLine() throws Exception {
			if (st.hasMoreTokens()) {
				StringBuilder str = new StringBuilder();
				boolean first = true;
				while (st.hasMoreTokens()) {
					if (first) {
						first = false;
					} else {
						str.append(" ");
					}
					str.append(st.nextToken());
				}
				return str.toString();
			} else {
				return br.readLine();
			}
		}
	}

	
}
