Problem: 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 

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;
  public class Task {
     
static BufferedReader s1;
static BufferedWriter out;
static String read() throws IOException{String line="";while(line.length()==0){line=s1.readLine();continue;}return line;}
static int int_v (String s1){return Integer.parseInt(s1);}
static long long_v(String s1){return Long.parseLong(s1);}
static int[] int_arr() throws IOException{String[] a=read().split(" ");int[] b=new int[a.length];for(int i=0;i<a.length;i++){b[i]=int_v(a[i]);}return b;}
static long[] long_arr() throws IOException{String[] a=read().split(" ");long[] b=new long[a.length];for(int i=0;i<a.length;i++){b[i]=long_v(a[i]);}return b;}
static void assign(){s1=new BufferedReader(new InputStreamReader(System.in));out=new BufferedWriter(new OutputStreamWriter(System.out));}
static long gcd(long a,long b){if(b==0){return a;}return gcd(b,a%b);}

 static long get ( long up,int b,int x) {
  if (up < b) return up + 1;
   long lim = (up - b + 1) / (b * x);
   long ret = b * (lim + 1) + Math.max(0, up - b * x * (lim + 1) + 1);
  return ret;
}
  public static void main(String args[]) throws  IOException {
        assign();
        int t=int_v(read());
        while(t--!=0){
            int[] n1=int_arr();
            int b=Math.max(n1[0],n1[1]),a=Math.min(n1[0],n1[1]);
            a=a/((int)gcd((long)a,(long)b));
            while(n1[2]--!=0){
                long[] lr=long_arr();
                lr[0]--;
                long ans=lr[1]-lr[0]-get(lr[1],b,a)+get(lr[0],b,a);
                out.write(ans+" ");
            }
            out.write("\n");
        }
            
            

             out.flush();
    }
           
}