Karafs is some kind of vegetable in shape of an 1 × h rectangle. Tavaspolis people love Karafs and they use Karafs in almost any kind of food. Tavas, himself, is crazy about Karafs.

<image>

Each Karafs has a positive integer height. Tavas has an infinite 1-based sequence of Karafses. The height of the i-th Karafs is si = A + (i - 1) × B.

For a given m, let's define an m-bite operation as decreasing the height of at most m distinct not eaten Karafses by 1. Karafs is considered as eaten when its height becomes zero.

Now SaDDas asks you n queries. In each query he gives you numbers l, t and m and you should find the largest number r such that l ≤ r and sequence sl, sl + 1, ..., sr can be eaten by performing m-bite no more than t times or print -1 if there is no such number r.

Input

The first line of input contains three integers A, B and n (1 ≤ A, B ≤ 106, 1 ≤ n ≤ 105).

Next n lines contain information about queries. i-th line contains integers l, t, m (1 ≤ l, t, m ≤ 106) for i-th query.

Output

For each query, print its answer in a single line.

Examples

Input

2 1 4
1 5 3
3 3 10
7 10 2
6 4 8


Output

4
-1
8
-1


Input

1 5 2
1 5 10
2 7 4


Output

1
2
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000000 + 10;
int A, B;
long long sum(int x) {
  return (long long)A * x + (long long)B * ((long long)x * (x - 1) / 2);
}
long long sum(int x, int y) { return sum(y) - sum(x - 1); }
bool check(int l, int r, int m, int t) {
  long long s = sum(l, r);
  if (s > (long long)m * t) return 0;
  if (A + (long long)(r - 1) * B > t) return 0;
  return 1;
}
int main() {
  int Q;
  scanf("%d%d%d", &A, &B, &Q);
  while (Q--) {
    int x, t, m;
    scanf("%d%d%d", &x, &t, &m);
    if (t < A + (long long)(x - 1) * B) {
      printf("-1\n");
      continue;
    }
    int l = x, r = (t - A) / B + 3;
    while (r - l > 1) {
      int mid = (r + l) / 2;
      if (check(x, mid, m, t))
        l = mid;
      else
        r = mid;
    }
    printf("%d\n", l);
  }
}
