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.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;

public class Solution{
    public static void main(String[] args){
        try{
            BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
            int t=Integer.parseInt(br.readLine());
            for (int i = 0; i <t ; i++) {
                String[] ss=br.readLine().split(" ");
                int a=Integer.parseInt(ss[0]);
                int b=Integer.parseInt(ss[1]);
                int q=Integer.parseInt(ss[2]);
                int lcm=lcm(a,b);
                StringBuilder str=new StringBuilder("");
                for (int j = 0; j <q ; j++) {
                    ss=br.readLine().split(" ");
                    long l=Long.parseLong(ss[0]);
                    long r=Long.parseLong(ss[1]);
                    if(a%b==0 || b%a==0){
                        str.append("0 ");
                        continue;
                    }
                    double x=((double)l)/lcm;
                    if(x!=(long)x){
                        x=(long)x+1;
                    }
                    long y=r/lcm;
                    if(x>y){
                        x=0;
                        y=0;
                    }
                    int c=Math.max(a,b);
                    long ans=(long)(y-x)*c;
                    if(l<c){
                            if(r>=c){
                                ans+=(c-l);
                            }else{
                                ans+=(r-l+1);
                            }
                    }
                    if(y!=0) {
                        if (y * lcm + c - 1 <= r) {
                            ans += c;
                        } else {
                            ans += (r - y * lcm + 1);
                        }
                    }
                    ans=(r-l+1)-ans;
                    str.append(ans+" ");
                }
                System.out.println(str);
            }


        }catch(Exception e){
            System.out.println("kkkk");
        }
    }
    static int lcm(int a,int b){
        return (a*b)/hcf(a,b);
    }
    static int hcf(int a,int b){
        if(a==0){
            return b;
        }
        if(b==0){
            return a;
        }
        if(a>b)
        return hcf(a%b,b);

        return hcf(a,b%a);
    }

    static class pair{
        int a,b;
        public pair(int a,int b){
            this.a=a;
            this.b=b;
        }
    }
}