[Codeforces 535C] Tavas and Karafs

 

#include<bits/stdc++.h>
using namespace std;
unsigned long long p,m,t,a,b,l,r,temp;
bool check(int mid){
    temp=(2*a+b*(p+mid-2))*(mid-p+1)/2;
//    cout<<temp<<endl;
    if(temp <= t*m && a+(mid-1)*b <=t) return true;
    return false;
}
int main() {
    int n;
    cin>>a>>b>>n;
    for(int i=0;i<n;i++){
        cin>>p>>t>>m;
        l=p;
        r=p+t;

        while(l<=r){
//            cout<<l<<" "<<r<<endl;
            int mid=(l+r)>>1;
            if(check(mid))l=mid+1;
            else r=mid-1;
        }

        if(l==p)cout<<"-1"<<endl;
        else cout<<l-1<<endl;
    }
    return 0;
}