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 
#include <bits/stdc++.h>
#pragma GCC optimize("fast-math")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC diagnostic ignored "-Woverflow"
using namespace std;
const short INF16 = ~(1 << 15);
const int mod = 998244353;
const int INF32 = ~(1ll << 31);
const int SZ = (1 << 18);
const long long INF64 = ~(1ull << 63);
const long long P = 53;
const long double eps = 1e-7;
const long double PI = acos(-1);
void Solve(int test_num) {
  long long a, b, q, d;
  cin >> a >> b >> q;
  d = (a * b);
  if (b < a) swap(a, b);
  while (q--) {
    long long l, r, ans = 0;
    cin >> l >> r;
    if (a == 1)
      cout << 0 << endl;
    else if (r - l <= d) {
      for (long long i = l; i <= r; i++) ans += (i % a % b != i % b % a);
    } else {
      long long ql = l, qr = r;
      for (long long i = l; i % d != 1; i++)
        l = i, ans += (i % a % b != i % b % a);
      for (long long i = r; i % d != max(a, b) - 1; i--)
        r = i, ans += (i % a % b != i % b % a);
      ans += (r - l) - (r - l) / min(a, b);
    }
    cout << ans << endl;
  }
}
signed main() {
  ios_base::sync_with_stdio(NULL);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << fixed << setprecision(8);
  srand(time(NULL));
  int test = 1;
  cin >> test;
  for (int i = 1; i <= test; i++) Solve(i);
}
