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;
void debug_out() { cerr << endl; }
template <typename H, typename... T>
void debug_out(H h, T... t) {
  cerr << " " << (h);
  debug_out(t...);
}
using int64 = long long int;
class CYetAnotherCountingProblem {
 public:
  void solve(std::istream& in, std::ostream& out) {
    int t;
    in >> t;
    while (t--) {
      int64 a, b, q;
      in >> a >> b >> q;
      if (a > b) swap(a, b);
      if ((b % a) == 0) {
        while (q--) {
          int64 l, r;
          in >> l >> r;
          out << 0 << " ";
        }
        out << endl;
        continue;
      }
      int period = 0;
      while (((period % a) % b) == ((period % b) % a)) {
        period++;
        assert(period < (3 * (a * b)));
      }
      int len = period;
      while (((len % a) % b) != ((len % b) % a)) {
        len++;
        assert(len < (3 * (a * b)));
      }
      int extra = len - period;
      while (q--) {
        int64 l, r;
        in >> l >> r;
        int64 ans = 0;
        int64 r_begin = (r / len) * len;
        int64 l_begin = (l / len) * len;
        if (l_begin != r_begin) {
          int64 dist = max(0LL, r_begin / len - l_begin / len - 1);
          ans += dist * extra;
          l -= l_begin;
          ans += extra - max(0LL, (l - period));
          r -= r_begin;
          ans += max(0LL, r - period + 1);
        } else {
          l -= l_begin;
          r -= r_begin;
          if (l >= period && r >= period) {
            ans += r - l + 1;
          } else if (l < period && r < period) {
          } else {
            ans += r - period + 1;
          }
        }
        out << ans << " ";
      }
      out << endl;
    }
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  CYetAnotherCountingProblem solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}
