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;
long long a, b, n, l, t, m;
bool f(int r) {
  long long x =
      (r - l + (long long)1) * (2 * a + b * (r + l - (long long)2)) / 2;
  if (a + b * (r - 1) > t) return false;
  return x <= m * t;
}
int main() {
  scanf("%I64d%I64d%I64d", &a, &b, &n);
  for (int i = 0; i < n; i++) {
    scanf("%d%d%d", &l, &t, &m);
    if (a + (l - 1) * b > t) {
      printf("-1\n");
      continue;
    }
    int low = l, high = 10000005;
    while (high - low > 1) {
      int mid = (high + low) / 2;
      if (!f(mid))
        high = mid;
      else
        low = mid;
    }
    if (f(high)) low = high;
    if (f(low))
      printf("%d\n", low);
    else
      printf("-1\n");
  }
  return 0;
}
