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 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int T = in.nextInt();
        while (T-- > 0) {
            int a = in.nextInt(), b = in.nextInt(), q = in.nextInt();
            int s = 0;
            int[] prefix = new int[a*b];
            for (int k=0;k<a*b;k++) {
                prefix[k] = (k%a)%b != (k%b)%a ? 1 : 0;
                s += prefix[k];
            }
            for (int i=1;i<a*b;i++) prefix[i] += prefix[i-1];
            for (int i=0;i<q;i++) {
                long l = in.nextLong(), r = in.nextLong();
                long ret = 0;
                if (l % (a*b) != 0) {
                    ret += s - prefix[(int)((l-1)%(a*b))];
                    l = l - l % (a*b) + a*b;
                }
                if (r % (a*b) != a*b-1) {
                    ret += prefix[(int)(r%(a*b))];
                    r = r - r % (a*b) - 1;
                }
                ret += (r - l + 1) / (a*b) * s;
                System.out.print(ret);
                System.out.print(" ");
            }
            System.out.println();
        }
    }
}
