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 Counting {

//	Yet Another Counting Problem
	public static void main(String[] args)throws IOException {
		// TODO Auto-generated method stub
		BufferedReader br =new BufferedReader(new InputStreamReader(System.in));
		long t=Long.parseLong(br.readLine());
		while(t-->0){
		String s[]=br.readLine().split(" ");
		long a= Long.parseLong(s[0]);
		long b= Long.parseLong(s[1]);
		long q= Long.parseLong(s[2]);
		while(q-->0){
		s=br.readLine().split(" ");
		long l= Long.parseLong(s[0]);
		long r= Long.parseLong(s[1]);
		long count=0;long temp=0;
		long small=(a<=b)?a:b;
		long big=(a>=b)?a:b;
		if(r<big)
		{
			System.out.print("0"+" ");
		}else if(r>=big){
			if(l<big) {
			temp+=Math.abs(big-l);//System.out.println(count+" "+temp);
			}
			long lcm=lcm(a,b);
		if((lcm==a)||(lcm==b))
		{
			System.out.print("0"+" ");
		}else {
			while(lcm<l&&((l-lcm)>big))
			{
				lcm+=lcm;//System.out.println(lcm);
//				System.out.println(count+" "+temp);
			}
			if((l-lcm)<=big&&lcm<=l)
			{
				temp+=big-(l-lcm);
				lcm+=lcm;//System.out.println(lcm);
//				System.out.println(count+" "+temp);
			}else {
				while(lcm<r&&(r-lcm)>=big)
				{
					temp+=big;
					lcm+=lcm;
				}
				if(lcm<r&&(r-lcm)<big)
				{
					temp+=r-lcm-1;
				}
				//temp+=(lcm==r)?1:0;
			}
			count=(r-l+1)-temp;
			System.out.print(count+" ");
		}
		
		}
		}System.out.println();
		}
	}
	static long gcd(long a,long b)//hcf or gcd of two nos
	{
		if(a==0)
			return b;
		return gcd(b%a,a);//or gcd(b,b%a)
	}
	static long lcm(long a,long b)
	{
		return a*b/gcd(a,b);
	}
	}


