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.*;
import  java.math.*;
import  java.util.*;

public class Main {
    public static void main(String[] args) {
    	Scanner cin = new Scanner(System.in);
    	int test = cin.nextInt();
    	while(test-- > 0){
    		long a = cin.nextLong();
    		long b = cin.nextLong();
    		int  n = cin.nextInt();
    		while(n-- > 0){
    			long l = cin.nextLong();
    			long r = cin.nextLong();
    			long ans = 0;
    			if(l <= a){
    				if(r <= a) ans = r-l+1;
    				else if(a < r && r < b) ans = r-l+1;
    				else if(r >= b){
    					if(r <= a*b) ans = b-l;
    					else {
    						ans = b-l;
    						long k = a*b, cnt = a*b;
    						if(k < l){
   							 if(k+b > l) ans += k+b-l;
   							 k = k+cnt;
   						 	}
    						while(r-k>=0){
    							if(r-k >= b) ans += b;
    							else if(r-k < b && r-k >= 0) ans+=r-k+1;
    							k = k+cnt;
    							
    						}
    					}
    				}
    			} else{
    				if(b <= l){
    					 if(r < a*b) ans = 0;
    					 else{
    						 long k = a*b, cnt = a*b;
    						 if(k < l){
    							 if(k+b > l) ans += k+b-l;
    							 k = k+cnt;
    						 }
     						while(r-k>=0){
     							if(r-k >= b) ans += b;
     							else if(r-k < b && r-k >= 0) ans+=r-k+1;
     							k = k+cnt;
     						}
    					 }
    				}
    				else{
    					if(r < b) ans =r-l+1;
        				else if(r >= b) {
        					 if(r < a*b) ans = r-l+1;
        					 else{
        						 long k = a*b, cnt = a*b;
        						 if(k < l){
        							 if(k+b > l) ans += k+b-l;
        							 k = k+cnt;
        						 }
         						while(r-k>=0){
         							if(r-k >= b) ans += b;
         							else if(r-k < b && r-k >= 0) ans+=r-k+1;
         							k = k+cnt;
         						}
        					 }
        				}
    				}
    			}
    			System.out.print((r-l+1)-ans+" ");
    		}
    		System.out.println();
    	}
//    	int ans = 0;
//    	for(int i = 100; i <= 200; i++){
//    		if(((i%7)%10) == ((i%10)%7)){
//    			 System.out.println(i);
//    			 ans++;
//    		}
//    	}
//    	System.out.println(ans);
    }
}
