#include<cstdio>

 #include<iostream>

 #include<cstring>

 #include<algorithm>

 #include<queue>

 #include<set>

 #include<map>

 #include<stack>

 #include<time.h>

 #include<cstdlib>

 #include<cmath>

 #include<list>

 using namespace std;

 #define MAXN 10000006

 #define eps 1e-8

 #define For(i,a,b) for(int i=a;i<=b;i++)

 #define Fore(i,a,b) for(int i=a;i>=b;i--)

 #define lson l,mid

 #define rson mid+1,r

 #define mkp make_pair

 #define pb push_back

 #define cr clear()

 #define sz size()

 #define met(a,b) memset(a,b,sizeof(a))

 #define iossy ios::sync_with_stdio(false)

 #define fr freopen

 #define pi acos(-1.0)

 #define Vector Point

 #define fir first

 #define sec second

 const long long inf=1LL<<;

 const int Mod=1e9+;

 typedef unsigned long long ull;

 typedef long long ll;

 typedef pair<int,int> pii;

 typedef pair<ll,ll> pll;

 inline int scan(){

     int x=,f=;char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

     return x*f;

 }

 struct LcSegmentTree{

     ll k,b,sk,sb;

     int mk;

     int ls,rs;

 };

 ll ans1,ans2;

 LcSegmentTree t[MAXN];

 int tot=;

 void seg1_change(int L,int R,ll a,ll b,int l,int r,int &rt){

     if(!rt) {

         rt=++tot;

         t[rt].k=;

         t[rt].b=-inf;

     }

     //cout<<L<<" "<<R<<" "<<a<<" "<<b<<" "<<l<<" "<<r<<" "<<rt<<" "<<t[rt].mk<<" "<<t[rt].k<<" "<<t[rt].b<<endl;

     if(L==l && R==r){

         bool f1=(t[rt].k*l+t[rt].b>=a*l+b),f2=(t[rt].k*r+t[rt].b>=a*r+b);

         if(f1&&f2) return ;

         if(!f1 && !f2) {t[rt].k=a,t[rt].b=b;return ;}

         int mid=l+r>>;

         bool fm=t[rt].k*mid+t[rt].b>=a*mid+b;

         if(f1){

             if(fm) seg1_change(mid+,R,a,b,rson,t[rt].rs);

             else {

                 seg1_change(L,mid,t[rt].k,t[rt].b,lson,t[rt].ls);

                 t[rt].k=a;

                 t[rt].b=b;

             }

         }else{

             if(fm) seg1_change(L,mid,a,b,lson,t[rt].ls);

             else {

                 seg1_change(mid+,R,t[rt].k,t[rt].b,rson,t[rt].rs);

                 t[rt].k=a;t[rt].b=b;

             }

         }

         return ;

     }

     int mid=l+r>>;

     if(R<=mid) seg1_change(L,R,a,b,lson,t[rt].ls);

     else if(L>mid) seg1_change(L,R,a,b,rson,t[rt].rs);

     else seg1_change(L,mid,a,b,lson,t[rt].ls),seg1_change(mid+,R,a,b,rson,t[rt].rs);

 }

 void seg2_change(int L,int R,ll a,ll b,int l,int r,int &rt){

     if(!rt) {

         rt=++tot;

         t[rt].k=;

         t[rt].b=-inf;

     }

     if(L==l && R==r) {

         t[rt].sk+=a;

         t[rt].sb+=b;

         return ;

     }

     int mid=l+r>>;

     if(R<=mid) seg2_change(L,R,a,b,lson,t[rt].ls);

     else if(L>mid) seg2_change(L,R,a,b,rson,t[rt].rs);

     else seg2_change(L,mid,a,b,lson,t[rt].ls),seg2_change(mid+,R,a,b,rson,t[rt].rs);

 }

 void query(int xx,int l,int r,int rt){

     if(!rt) return ;

     ans1+=t[rt].sk*xx+t[rt].sb;

     ans2=max(ans2,t[rt].k*xx+t[rt].b);

     if(l==r) return ;

     int mid=l+r>>;

     if(xx<=mid) query(xx,lson,t[rt].ls);

     else  query(xx,rson,t[rt].rs);

 }

 int n,m,ty,u,v,ps,rot;

 ll a,b;

 void solve(){

     met(t,);

     tot=;rot=;

     n=scan();m=scan();

     while(m--){

         ty=scan();

         if(ty==) {

             ps=scan();

             ans1=;ans2=-inf;

             query(ps,,n,rot);

             if(ans2<=-inf) puts("NA");

             else printf("%lld\n",ans1+ans2);

         }else{

             u=scan();v=scan();a=scan();b=scan();

             b=b-a*u;

             if(ty==) seg1_change(u,v,a,b,,n,rot);

             else seg2_change(u,v,a,b,,n,rot);

         }

     }

 }

 int main(){

     int t=;

     while(t--) solve();

     return ;

 }