#include <bits/stdc++.h>
using namespace std;

class cht {
    private:
    map<long long, long long> lines;
    long long tmax(long long a1, long long b1, long long a2, long long b2){
        assert(a1<a2);
        return (b1-b2)/(a2-a1);
    }
    bool need(long long a1, long long b1, long long a2, long long b2, long long a3, long long b3){
        assert(a1<a2 && a2<a3);
        return tmax(a1,b1,a2,b2)<tmax(a2,b2,a3,b3);
    }
    long long h(long long t, map<long long, long long>::iterator it){
        return it->first*t+it->second;
    }
    public:
    cht(){
        lines[0]=-2e18;
        lines[5e10]=-9e18;
    }
    void add(long long a, long long b){
        auto it_first=lines.begin();
        auto it_last=lines.end();
        --it_last;
        if(lines.count(a)){
            if(lines[a]>b){
                return;
            } else {
                lines.erase(a);
            }
        }
        auto it_next=lines.upper_bound(a);
        auto it_prev=it_next;
        --it_prev;
        if(!need(it_prev->first, it_prev->second, a, b, it_next->first, it_next->second)){
            return;
        }
        lines[a]=b;
        auto it=lines.find(a);
        auto it_n1=it;
        auto it_n2=it;
        if(it!=it_last){
            ++it_n1;
            ++it_n2;
            if(it_n1!=it_last){
                ++it_n2;
                while(!need(it->first, it->second, it_n1->first, it_n1->second, it_n2->first, it_n2->second)){
                    auto it_tmp=it_n2;
                    lines.erase(it_n1);
                    if(it_n2==it_last){
                        break;
                    } else {
                        it_n1=it_tmp;
                        ++it_n2;
                    }
                }
            }
        }
        auto it_p1=it;
        auto it_p2=it;
        if(it!=it_first){
            --it_p1;
            --it_p2;
            if(it_p1!=it_first){
                --it_p2;
                while(!need(it_p2->first, it_p2->second, it_p1->first, it_p1->second, it->first, it->second)){
                    auto it_tmp=it_p2;
                    lines.erase(it_p1);
                    if(it_p2==it_first){
                        break;
                    } else {
                        it_p1=it_tmp;
                        --it_p2;
                    }
                }
            }
        }
    }
    long long max(long long t){
        auto it=lines.begin();
        ++it;
        auto it_next=it;
        ++it_next;
        while(h(t,it)<h(t,it_next)){
            auto it_tmp=it_next;
            lines.erase(it);
            ++it_next;
            it=it_tmp;
        }
        return h(t,it);
    }
};

int main(void)
{
    int a;
    cin >> a;
    int q;
    cin >> q;
    cht l;
    while(q--){
        int e;
        cin >> e;
        if(e==1){
            long long s,t;
            cin >> s >> t;
            l.add(a*(s+t),-a*s*t);
        } else {
            long long t;
            cin >> t;
            long long lmax=l.max(t);
            cout << max(lmax-a*t*t,0LL) << endl;
        }
    }
    return 0;
}