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

public class ct1 {

    static long lcm(long a, long b){
        long num1 = a, num2=b;
        while (num1 != num2) {
            if(num1 > num2)
                num1 = num1 - num2;
            else
                num2 = num2 - num1;
        }
        return (a*b)/num2;
    }

    static long calc(long x, int a, int b){
        if(x<b)
            return 0;
        long lCM = lcm(a,b);
        long times = (((x/lCM) + 1)*(b))-1;
        long extra = (x%lCM);
        if(extra<b)
            times -= (b-extra-1);
        return x-times;
    }

    public static void main(String[] args) {
//        System.out.println((long)(Integer.MAX_VALUE)+1);
        Scanner inp = new Scanner(System.in);
        int n = inp.nextInt();
        while (n-- > 0) {
            int a = inp.nextInt();
            int b = inp.nextInt();
            int q = inp.nextInt();
            if(a > b){
                int temp = b;
                b= a;
                a = temp;
            }
            for (int i = 0; i < q; i++) {
                long m = inp.nextLong();
                long nn = inp.nextLong();
                if(lcm(a, b) == b)
                    System.out.print(0 + " ");
                else
                    System.out.print(calc(nn, a, b) - calc(m-1, a, b) + " ");
            }
            System.out.println();

        }
    }
}