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>
using namespace std;
long long GCD(long long a, long long b) {
  if (b == 0) return a;
  return GCD(b, a % b);
}
long long LCM(long long a, long long b) { return (a * b) / GCD(a, b); }
void solve() {
  long long a, b, q, ss, ans;
  cin >> a >> b >> q;
  if (a > b) swap(a, b);
  while (q--) {
    long long l, r, f2 = 0;
    cin >> l >> r;
    long long tot;
    if (a == b) {
      if (l >= b)
        tot = (r - l);
      else
        tot = (r - b);
    } else {
      if (l >= b)
        tot = (r - l + 1);
      else
        tot = (r - b + 1);
    }
    if (tot <= 0)
      cout << 0 << " ";
    else {
      long long xx = LCM(a, b);
      for (long long i = r - b + 1; i <= r; i++) {
        if (i % xx == 0) {
          ss = i;
          f2 = 1;
          break;
        }
      }
      long long tt = r / xx;
      long long cc = tt * xx;
      long long pp = (l - 1) / xx;
      long long res = tt - pp;
      if (res >= 1) {
        ans = (tot - (res - 1) * b);
        ans -= min(r - cc + 1, b);
      } else
        ans = tot;
      cout << ans << " ";
    }
  }
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  while (t--) solve();
  return 0;
}
