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

public class C { //WA 3

    static long[] addCnt = new long[4000110];

    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
            int testCnt = Integer.parseInt(br.readLine());
            int start = 1;
            for (int i = 0; i < testCnt; i++) {
                String[] line = br.readLine().split(" ");
                int a = Integer.parseInt(line[0]);
                int b = Integer.parseInt(line[1]);
                int queryCnt = Integer.parseInt(line[2]);

                if (a > b) {
                    int temp = a;
                    a = b;
                    b = temp;
                }
                int len = a * b;
                for (int j = 0; j < len; j++) {
                    addCnt[start + j] = addCnt[start + j - 1];
                    if (j%a != (j%b)%a) {
                        addCnt[start + j]++;
                    }
                }

                for (int j = 0; j < queryCnt; j++) {
                    line = br.readLine().split(" ");
                    long l = Long.parseLong(line[0]);
                    long r = Long.parseLong(line[1]);
                    long cnt = (r / len - (l / len)) * (addCnt[start + len - 1]);
                    cnt -= addCnt[start + ((int) (l % len)) - 1];
                    cnt += addCnt[start + ((int) (r % len))];
                    bw.write(cnt + " ");
                }

                bw.newLine();

                start += a * b + 1;
            }
            br.close();
            bw.close();
        }
        catch (Exception e) {
            e.printStackTrace();
        }
    }

    public static void dbug(String s, long ... a) { // /*
        String[] line = s.split("<>");
        for (int i = 0; i < a.length; i++) {
            System.out.print(line[i] + a[i]);
        }
        System.out.println(line[a.length]); // */
    }

    public static void print(int[] a) { // /*
        for (int i = 0; i < a.length; i++) {
            System.out.print(a[i] + " ");
        }
        System.out.println(); // */
    }
}