#include<bits/stdc++.h>
#define pb emplace_back
#define fi first
#define se second
#define mp make_pair
#define ls (p<<1)
#define rs (p<<1|1)
#define mid (l+r>>1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<int,pair<int,int> > pii;
const int maxn=5e5+10;
int n,m,qc=0; ll ans[maxn];
struct Query{
	int x,l,r,id,tim;
	bool operator < (const Query &rhs) const { return x<rhs.x; }
}; vector<Query> q; int val[maxn][3],t;
struct Change{
	int a,b,l,r,id;
}a[maxn<<1];
struct node{
	int x,y;
	node operator - (const node& rhs){ return {x-rhs.x,y-rhs.y}; }
	ll operator * (const node &rhs){ return 1ll*x*rhs.y-1ll*y*rhs.x; }
	ll val(int k){ return 1ll*k*x+y; }
};
bool cmp(node s1,node s2){ return s1.x==s2.x?s1.y<s2.y:s1.x<s2.x; }
int cur[maxn],tot=0;
struct SegmentTree{
	vector<node> s[maxn<<2]; int to[maxn<<2];
	void build(int p,int l,int r){
		to[p]=0;
		if(l==r){ s[p].clear(); s[p].pb((node){val[l][1],val[l][2]}); return ; }
		build(ls,l,mid); build(rs,mid+1,r);
		s[p].resize(s[ls].size()+s[rs].size());
		merge(s[ls].begin(),s[ls].end(),s[rs].begin(),s[rs].end(),s[p].begin(),cmp);
		int top=-1;
		for(auto z:s[p]){
			while(top>=1&&(s[p][top]-s[p][top-1])*(z-s[p][top-1])>=0) top--;
			s[p][++top]=z;
		}
		s[p].resize(top+1);
	}
	ll query(int p,int l,int r,int ql,int qr,int k){
		if(val[r][0]<ql||val[l][0]>qr) return 0;
		if(ql<=val[l][0]&&val[r][0]<=qr){
			while(to[p]+1<(int)s[p].size()){
				if(s[p][to[p]].val(k)<=s[p][to[p]+1].val(k)) to[p]++;
				else break;
			}
			return s[p][to[p]].val(k);
		}
		ll res=0;
		res=max(res,query(ls,l,mid,ql,qr,k));
		res=max(res,query(rs,mid+1,r,ql,qr,k));
		return res;
	}
}seg;
namespace DS{
	vector<pii > op[maxn<<2];
	void modify(int p,int l,int r,int ql,int qr,pii z){
		if(ql<=l&&r<=qr){ op[p].pb(z); return ; }
		if(ql<=mid) modify(ls,l,mid,ql,qr,z);
		if(qr>mid) modify(rs,mid+1,r,ql,qr,z);
	}
	void query(int p,int l,int r,vector<Query> vec){
		if(vec.empty()) return ;
		if(op[p].size()){
			sort(op[p].begin(),op[p].end()); t=0;
			for(auto z:op[p]) val[++t][0]=z.fi,val[t][1]=z.se.fi,val[t][2]=z.se.se;
			seg.build(1,1,t);
			sort(vec.begin(),vec.end());
			for(auto z:vec)
				ans[z.id]=max(ans[z.id],seg.query(1,1,t,z.l,z.r,z.x));
		}
		if(l==r) return ; q.clear(); 
		for(auto z:vec)
			if(z.tim<=mid) q.pb(z);
		query(ls,l,mid,q); q.clear();
		for(auto z:vec)
			if(z.tim>mid) q.pb(z);
		query(rs,mid+1,r,q);
	}
}
int main(){
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin>>n>>m; tot=n;
	for(int i=1;i<=n;i++){
		int A,B; cin>>A>>B;
		a[i]={A,B,1,m,i}; cur[i]=i;
	}
	for(int i=1;i<=m;i++){
		int op,k,x,y;
		cin>>op>>k>>x>>y;
		if(op==1){
			a[cur[k]].r=i-1;
			cur[k]=++tot; a[tot]={x,y,i,m,k};
		}else q.pb((Query){k,x,y,++qc,i});
	}
	for(int i=1;i<=tot;i++)
		if(a[i].l<=a[i].r) DS::modify(1,1,m,a[i].l,a[i].r,mp(a[i].id,mp(a[i].a,a[i].b)));
	DS::query(1,1,m,q);
	for(int i=1;i<=qc;i++) cout<<ans[i]<<"\n";
	return 0;
}