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.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Main m = new Main();

		m.func(new Scanner(System.in));

	}

	long gcd(long a, long b) {
		return b == 0 ? a : gcd(b, a % b);
	}

	ArrayList<Integer> get_primes(int limit) {
		ArrayList<Integer> res = new ArrayList<>();
		a:
		for (int i = 2; i <= limit; i++) {
			int temp = (int) Math.sqrt(i);

			for (int j = 2; j <= temp; j++) {
				if (i % j == 0) {
					continue a;
				}
			}
			res.add(i);
		}
		return res;
	}

	ArrayList<Long> get_factor(ArrayList<Integer> ps, long x) {

		ArrayList<Long> res = new ArrayList<>();
		for (int y : ps) {
			boolean enter = false;
			while (x % y == 0) {

				enter = true;
				x /= y;
			}
			if (enter) {
				res.add((long) y);
			}
			if (x == 1) {
				return res;
			}
		}
		res.add(x);
		return res;
	}


	void func(Scanner s) {
		int T = s.nextInt();
		while (T-- != 0) {
			int a = s.nextInt();
			int b = s.nextInt();
			int min = Math.max(a, b);
			int q = s.nextInt();
			int lcm = (int) (a * b / gcd(a, b));
			while (q-- != 0) {
				long l = s.nextLong();
				long r = s.nextLong();
				long down = l / lcm * lcm;
				long up = r / lcm * lcm;
				long res = (up - down) / lcm * min + Math.min(min, r - up + 1) - Math.min(min, l - down);
				System.out.println(r - l + 1 - res);

			}
		}
	}

	int[][] temp = new int[][]{{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
}

class Node {
	int gap;

	int be;

	public Node(int gap, int be) {
		this.gap = gap;

		this.be = be;
	}
}