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:
//package cf;

import java.util.*;
import java.io.*;

public class Cf{
    static class Node{
        int sum,occur;
        Node(int sum){
            this.sum=sum;
        }
    }
    
    
    public static void main(String[]args){
        Scanner in=new Scanner(System.in);
        PrintWriter out=new PrintWriter(System.out);
        long t=in.nextLong();
        while(t-->0){
            int a=in.nextInt();
            int b=in.nextInt();
            
            int q=in.nextInt();
            
            long prefix[]=new long[a*b+1];
            
            for(int i=0;i<=a*b;i++){
                if(((i%a)%b)!=((i%b)%a)){
                    prefix[i]=1;
                }
            }
            for(int i=1;i<=a*b;i++){
                prefix[i]+=prefix[i-1];
            }
            while(q-->0){
                long l=in.nextLong()-1;
                long r=in.nextLong();
                long ans=prefix[a*b]*(l/(a*b))+prefix[(int)(l%(a*b))];
                ans=prefix[a*b]*(r/(a*b))+prefix[(int)(r%(a*b))]-ans;
               out.print(ans+" ");
            
            }
            out.println();
            
            
            
        }
        in.close();
        out.close();
    }
}