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;
#pragma comment(linker, "/STACK:100000000")
long long sum[2000200];
int main() {
  int A, B, N;
  scanf("%d %d %d", &A, &B, &N);
  sum[1] = A;
  for (int i = 2; i < 2000200; i++) sum[i] = sum[i - 1] + (long long)B;
  for (int i = 1; i < 2000200; i++) sum[i] += sum[i - 1];
  for (int test = 0; test < N; test++) {
    int L, t, m;
    scanf("%d %d %d", &L, &t, &m);
    long long first = sum[L] - sum[L - 1];
    int l = L - 1, r = 2000000;
    while (l < r) {
      int av = (l + r + 1) / 2;
      long long second = sum[av] - sum[av - 1];
      if (second > t) {
        r = av - 1;
        continue;
      }
      long long s = sum[av] - sum[L - 1];
      int cnt = min(m, av - L + 1);
      if (s > (long long)t * (long long)(cnt)) {
        r = av - 1;
        continue;
      }
      l = av;
    }
    if (l >= L) {
      printf("%d\n", l);
    } else
      printf("-1\n");
  }
  return 0;
}
