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.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Random;
import java.util.Scanner;

public class ProblemC {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		PrintWriter out = new PrintWriter(System.out);
		Scanner s = new Scanner(System.in);
		int t = s.nextInt();
		
		for(int a=0;a<t;a++) {
			int x = s.nextInt();
			int y = s.nextInt();
			int q = s.nextInt();
			
			int lc = getl(x, y);
			int count = 0;
			int[] pre = new int[lc + 1];
			int[] suf = new int[lc + 1];
			for(int i=1;i<=lc;i++) {
				if((i%x)%y != (i%y)%x)
					count++;
				
				pre[i] = count;
			}
			int cc = 0;
			for(int i=lc;i>=1;i--) {
				if((i%x)%y != (i%y)%x)
					cc++;
				
				suf[lc - i] = cc;
			}
			//System.out.println(count + " "+lc);
			for(int i=0;i<q;i++) {
				long l = s.nextLong();
				long r = s.nextLong();
				
				long ceil = l/lc;
				if(l%lc !=0)
					ceil++;
				long low = (long)ceil * lc;
				
				long high = (long)(r/lc) * lc;
			
				//System.out.println(low+"- "+high);
				long div = (high - low)/lc + 1;
				
				if(div == 0) {
					int c = pre[(int)(r%lc)] - pre[(int)((l-1)%lc)];
					
					//System.out.println("hey");
					System.out.print(c+" ");
				}
				
				else {
					int c = suf[(int)(low - l)] + pre[(int)(r - high)];
					
					System.out.print(((div-1) * count + c)+" ");
				}
				
				
			}
			System.out.println();
		}
		
	}
	
	public static int getl(int x, int y) {
		return (x * y)/geth(Math.max(x,y), Math.min(x, y));
	}
	
	public static int geth(int x, int y) {
		if(y == 0)
			return x;
		else
			return geth(y, x%y);
	}

	
}