二分初练

Description

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.

Each Karafs has a positive integer height. Tavas has an infinite 1-based sequence of Karafses. The height of the i-th Karafs is s_i = 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 ≤ rand sequence s_l, s_l + 1, ..., s_r 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 ≤ 10⁶, 1 ≤ n ≤ 10⁵).

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

Output

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

Sample Input

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

                                                       

前面几题比较容易写起来很顺手，一直卡在这题，这题题意真心难懂。。。读懂了也不好做，关键在于理解选m长度的数列满足条件必然有Sn>=t*m。

#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
long long a,b,n,l,t,m,le,ri,mid;
long long geta(long long x)
{//printf("%d %d\n",le,ri);
return a+(x-1)*b;
}
long long getb(long long x)
{
return (geta(l)+geta(x))*(x-l+1)/2;
}
int main()
{
int i,j;
scanf("%lld %lld %lld",&a,&b,&n);
while(n--)
{
scanf("%lld %lld %lld",&l,&t,&m);
if(geta(l)>t) {printf("-1\n");continue;}
le=l;ri=(t-a)/b+1;
while(le<=ri)
{
mid=(le+ri)/2;
if(getb(mid)<=t*m) {le=mid+1;}
else {ri=mid-1;}
//printf("%lld %lld\n",le,ri);

}
printf("%lld\n",le-1);
}
return 0;
}