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.*;
public class Solution{
 
     public static void main(String []args){
        Scanner input = new Scanner(System.in);
        int t = input.nextInt();
        input.nextLine();
        for (int i = 0; i < t; i++) {
            String aBQ = input.nextLine();
            String[] split = aBQ.split(" ");
            int a = Integer.parseInt(split[0]);
            int b = Integer.parseInt(split[1]);
            int q = Integer.parseInt(split[2]);
            String[] ans = new String[q];
            for (int j = 0; j < q; j++) {
                String query = input.nextLine();
                String[] querySplit = query.split(" ");
                int l = Integer.parseInt(querySplit[0]);
                int r = Integer.parseInt(querySplit[1]);
                int count = r - l + 1;
                if (a == b) {
                    ans[j] = Integer.toString(0);
                } else {
                    
                    
                    int min = Math.min(a, b);
                    int max = Math.max(a, b);
                    
                    // find lcm
                    int lcm = a*b;
                    for (int k = 1; k <= (a * b); k++) {
                        if ((k % a) == 0 && (k % b) == 0) {
                            lcm = k;
                            break;
                        }
                    }

                    int start;
                    for (start = l; ((start % lcm) != 0 && start <= r); start++) {
                        if (((start % a) % b) == ((start % b) % a)) {
                            count--;
                        }
                    }

                    
                    int end;
                    for (end = r; ((end % lcm) != 0 && end > start); end--) {
                        if (((end % a) % b) == ((end % b) % a)) {
                            count--;
                        }
                    }

                    if (start < end) {
                        count -= (((end / lcm) - (start / lcm)) * max);
                    }
                    
                    ans[j] = Integer.toString(count);
                }
                
            }
            
            System.out.println(String.join(" ", ans));
            
        }
     }
}