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.Scanner;

public class C {
    static long gcd(long x, long y) {
        if (x == 0) return y;
        return gcd(y % x, x);
    }

    static void verify(long a, long b, long l, long r, long ret) {
        long cnt = 0;
        for (long i=l;i<=r;i++) {
            if ((i%a)%b != (i%b)%a) cnt++;
        }
        if (cnt != ret) throw new RuntimeException();
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int T = in.nextInt();
        while (T-- > 0) {
            long a = in.nextInt(), b = in.nextInt(), q = in.nextInt();
            long g = a * b / gcd(a, b);
            for (int i=0;i<q;i++) {
                long l = in.nextLong(), r = in.nextLong();
                if (l % g < Math.max(a, b)) l = l - l % g + Math.max(a, b);
                long ret = 0;
                long x = (l - 1) / g, y = r / g;
                ret = r - l + 1 - (y - x) * Math.max(a, b);
//                verify(a, b, l, r, ret);
                ret = Math.max(ret, 0);
                System.out.print(ret);
                System.out.print(" ");
            }
            System.out.println();
        }
    }
}
