2021-07-19

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 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

这一题 真的 我英语渣渣 语文理解也渣渣 看个题太累了
题意
给你一个以A为首相，B为公差的等差数列；
再给你n组数据 每组给你一个 l, t,m;
意思是 让你从数列的第l个开始 选取m 个数 每个数- 1 -1的操作为t次
操作t次之后最大的r的值；
大概就这么个意思；
则这个r满足以下两个条件
r<=m;
al+a(l+1)+…+ar<=m*t;

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<queue>
using namespace std;
typedef long long ll;
const int maxx=1000005;
ll a,b,n,l,t,m;
ll get(ll num)
{
    return a+(num-1)*b;
}
ll getsum(ll rr)
{
    ll ans=(get(rr)+get(l))*(rr-l+1)/2;
    return ans;
}
int main()
{

    cin>>a>>b>>n;
    while(n--)
    {
        cin>>l>>t>>m;
        ll left=l,right=(t-a)/b+1,mid;
        if(get(l)>t)
            cout<<"-1"<<endl;
        else
        {

            while(left<=right)
            {
                mid=(left+right)/2;
                if(getsum(mid)<=t*m)
                    left=mid+1;
                else
                    right=mid-1;
            }
            cout<<left-1<<endl;
        }
    }
    return 0;
}