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 YetAnotherCountingEfficientEduRound86C{
	static class FastReader {

        BufferedReader br;
        StringTokenizer st;

        private FastReader() {
            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());
        }

	 int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
	}

	int[] nextIntArrayOne(int n) {
				int[] a = new int[n+1];
				for (int i = 0; i < n+1; i++)
					a[i] = nextInt();
				return a;
	}

        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;
        }
    }

	public static void main(String[] args) {
		FastReader s =new FastReader();
		int t = s.nextInt();
		StringBuilder str = new StringBuilder();
		while(t-- >0) {
			long a = s.nextLong();
			long b = s.nextLong();
			int q = s.nextInt();
			long g = gcd(a,b);
			long l = (a*b)/g;
			//System.out.println(g+" "+l);
			long poss =l-Math.max(a, b);
			long notposs = l-poss; 
			//System.out.println(poss+" "+notposs);
			while(q-- >0) {
				long  left= s.nextLong();
				long right = s.nextLong();
				if(l==b||right<b) {
					str.append(0).append(" ");
					continue;
				}
				
			    long ans = range(right,l,poss,notposs);
				ans-=range(left-1, l, poss, notposs);
			    str.append(ans).append(" ");
				}
			str.append("\n");
			
		}
		System.out.println(str);
	}

	
	
	
	private static long range(long right, long l,long poss, long notposs) {
		long q = right/l;
		long r = right%l;
		long ans  = 0;
		if(q!=0) {
			ans = q*poss;
			}
		if(r!=0) {
			ans += Math.max(r-notposs+1,0);
		}
		//System.out.println(ans);
		return ans;
	}



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

	

}
