#include <bits/stdc++.h>
#define y1 iusfnofrfes
#define yn oihfioiirfr
#define N 6011
#define ll long long
#define pii pair<ll,ll>
#define s1 first
#define s2 second
using namespace std;
int n,q,xn,yn,w[N];ll x1[N],y1[N],x2[N],y2[N],ix[N],iy[N];
ll dp[N][N],rw[N][N],uw[N][N];
struct lsh{ll v,*id;}ql[N];int qn;ll ans[3000011];
bool cmp(lsh a,lsh b){return a.v<b.v;}
struct kueri{ll x,y,id;};
struct edge{kueri v;int next;edge(){}edge(kueri _v,int _next){v=_v;next=_next;}}e[3000011];int head[N][N],sz;
void init(){memset(head,-1,sizeof(head));sz=0;}void insert(int x,int y,kueri k){e[++sz]=edge(k,head[x][y]);head[x][y]=sz;}
namespace sgt
{
	ll a[N*40],b[N*40];int lc[N*40],rc[N*40],rt,sz;
	void clear(){rt=sz=1;a[1]=b[1]=lc[1]=rc[1]=0;}
	void add(ll A,ll B,ll L=-3e9,ll R=3e9,int &x=rt)
	{
		if(!x)x=++sz,a[x]=b[x]=lc[x]=rc[x]=0;
		if(L==R)
		{
			if(A*L+B<a[x]*L+b[x])a[x]=A,b[x]=B;
			return;
		}
		ll M=L+R>>1;
		if(A*M+B>a[x]*M+b[x])swap(a[x],A),swap(b[x],B);
		if(a[x]<A)add(A,B,M+1,R,rc[x]);else add(A,B,L,M,lc[x]);
	}
	ll query(ll k,ll L=-3e9,ll R=3e9,int x=rt)
	{
		if(!x)return 0;
		if(L==R)return a[x]*k+b[x];
		ll val=a[x]*k+b[x];
		if(k<=L+R>>1)return max(val,query(k,L,L+R>>1,lc[x]));else return max(val,query(k,(L+R>>1)+1,R,rc[x]));
	}
}
int main()
{
	scanf("%d%d",&n,&q);init();
	for(int i=1;i<=n;++i)
	{
		ll t,a,b;scanf("%lld%lld%lld%lld",&t,&a,&b,w+i);w[i]/=2;
		if(a<b)x1[i]=x2[i]=t-a,y1[i]=a+t,y2[i]=2*b+t-a;
		else y1[i]=y2[i]=a+t,x1[i]=t-a,x2[i]=a+t-2*b;
	}
	qn=0;
	for(int i=1;i<=n;++i)
	{
		++qn;ql[qn].v=x1[i];ql[qn].id=x1+i;
		++qn;ql[qn].v=x2[i];ql[qn].id=x2+i;
	}
	sort(ql+1,ql+1+qn,cmp);
	ql[0].v=-1e18;for(int i=1;i<=qn;++i)xn+=ql[i].v!=ql[i-1].v,*ql[i].id=xn,ix[xn]=ql[i].v;
	qn=0;
	for(int i=1;i<=n;++i)
	{
		++qn;ql[qn].v=y1[i];ql[qn].id=y1+i;
		++qn;ql[qn].v=y2[i];ql[qn].id=y2+i;
	}
	sort(ql+1,ql+1+qn,cmp);
	ql[0].v=-1e18;for(int i=1;i<=qn;++i)yn+=ql[i].v!=ql[i-1].v,*ql[i].id=yn,iy[yn]=ql[i].v;
	for(int i=1;i<=n;++i)
	{
		if(x1[i]==x2[i])for(int j=y1[i];j<y2[i];++j)uw[x1[i]][j]=max((ll)w[i],uw[x1[i]][j]);
		if(y1[i]==y2[i])for(int j=x1[i];j<x2[i];++j)rw[j][y1[i]]=max((ll)w[i],rw[j][y1[i]]);
	}
	for(int i=xn;i;--i)
	{
		for(int j=yn;j;--j)
		{
			if(i<xn)dp[i][j]=max(dp[i][j],dp[i+1][j]+(ix[i+1]-ix[i])*rw[i][j]);
			if(j<yn)dp[i][j]=max(dp[i][j],dp[i][j+1]+(iy[j+1]-iy[j])*uw[i][j]);
		}
	}
	for(int i=1;i<=q;++i)
	{
		int px,py,x,y,rx,ry;scanf("%d%d",&px,&py);
		x=px-py;y=px+py;
		rx=lower_bound(ix+1,ix+1+xn,x)-ix;
		ry=lower_bound(iy+1,iy+1+yn,y)-iy;
		ans[i]=dp[rx][ry];
		kueri k;k.x=x;k.y=y;k.id=i;
		insert(rx,ry,k);
	}
	for(int i=1;i<=xn;++i)
	{
		sgt::clear();
		for(int j=yn;j;--j)
		{
			if(rw[i-1][j])sgt::add(-rw[i-1][j],dp[i][j]+ix[i]*rw[i-1][j]);
			for(int k=head[i][j];~k;k=e[k].next)ans[e[k].v.id]=max(ans[e[k].v.id],sgt::query(e[k].v.x));
		}
	}
	for(int i=1;i<=yn;++i)
	{
		sgt::clear();
		for(int j=xn;j;--j)
		{
			if(uw[j][i-1])sgt::add(-uw[j][i-1],dp[j][i]+iy[i]*uw[j][i-1]);
			for(int k=head[j][i];~k;k=e[k].next)ans[e[k].v.id]=max(ans[e[k].v.id],sgt::query(e[k].v.y));
		}
	}
	for(int i=1;i<=q;++i)printf("%lld\n",ans[i]);return 0;
}