#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n;++i)
#define yn sjdfklsneklrn
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const int Mod = 998244353;
const int inv2 = (Mod+1) / 2;
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, int p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 100;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
}
int binom(int n, int m){ return mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
inline void chmax(ll &a, ll b){ (b>a) ? (a=b) : 0; }

struct Line{
	ll k, b; 
	Line(){}
	Line(ll k, ll b) : k(k), b(b){}
}; 

ll n, q, xl[6060], yl[6060], xr[6060], yr[6060], w[6060], xp[6060], yp[6060], xn, yn, qx[3000300], qy[3000300], stktop; 
Line stk[6060]; 
ll dp[6060][6060], wu[6060][6060], wr[6060][6060], ans[3000300]; 
vi adj[6060][6060]; 

inline void addLine(ll k, ll b){
	k = -k; 
	while(stktop && stk[stktop].k >= k) stktop--; 
	while(stktop > 1 && (__int128)(stk[stktop].b - b) * (k - stk[stktop - 1].k) <= (__int128)(stk[stktop - 1].b - b) * (k - stk[stktop].k)) stktop--; 
	stk[++stktop] = Line(k, b); 
}

inline ll qMax(ll x){
	x = -x; 
	int l = 1, r = stktop + 1; 
	while(l < r - 1){
		int mid = l + r >> 1; 
		if(stk[mid].b - stk[mid - 1].b <= (__int128)x * (stk[mid - 1].k - stk[mid].k)) r = mid; 
		else l = mid; 
	}
	return stk[l].k * x + stk[l].b; 
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> n >> q;
	for(int i = 1; i <= n; ++i){
		ll t, a, b;
		cin >> t >> a >> b;
		cin >> w[i]; w[i] /= 2;
		xl[i] = t + a;  yl[i] = t - a;  xr[i] = t + abs(a - b) + b;  yr[i] = t + abs(a - b) - b; 
		xp[i] = xl[i];  xp[i + n] = xr[i];  yp[i] = yl[i];  yp[i + n] = yr[i]; 
	}
	
	sort(xp + 1, xp + 2 * n + 1); 
	sort(yp + 1, yp + 2 * n + 1); 
	xn = unique(xp + 1, xp + 2 * n + 1) - xp - 1; 
	yn = unique(yp + 1, yp + 2 * n + 1) - yp - 1; 
	for(int i = 1; i <= n; i++){
		xl[i] = lower_bound(xp + 1, xp + xn + 1, xl[i]) - xp; 
		xr[i] = lower_bound(xp + 1, xp + xn + 1, xr[i]) - xp; 
		yl[i] = lower_bound(yp + 1, yp + yn + 1, yl[i]) - yp; 
		yr[i] = lower_bound(yp + 1, yp + yn + 1, yr[i]) - yp; 
	}
	for(int i = 1; i <= n; i++){
		if(xl[i] == xr[i]){
			for(int j = min(yl[i], yr[i]); j < max(yl[i], yr[i]); j++) wu[xl[i]][j] = max(wu[xl[i]][j], 1ll * w[i]); 
		} else {
			for(int j = min(xl[i], xr[i]); j < max(xl[i], xr[i]); j++) wr[j][yl[i]] = max(wr[j][yl[i]], 1ll * w[i]); 
		}
	}
	//for(int i = 1; i <= xn; i++){
	//	for(int j = 1; j <= yn; j++) cout << wu[i][j] << " "; 
	//	cout << endl; 
	//}
	//for(int i = 1; i <= xn; i++){
	//	for(int j = 1; j <= yn; j++) cout << wr[i][j] << " "; 
	//	cout << endl; 
	//}
	for(int i = xn; i >= 1; i--){
		for(int j = yn; j >= 1; j--) dp[i][j] = max(dp[i][j + 1] + wu[i][j] * (yp[j + 1] - yp[j]), dp[i + 1][j] + wr[i][j] * (xp[i + 1] - xp[i])); 
	}
	//for(int i = 1; i <= xn; i++){
	//	for(int j = 1; j <= yn; j++) cout << dp[i][j] << " "; 
	//	cout << endl; 
	//}

	for(int i = 1; i <= q; i++){
		ll p, x;
		cin >> p >> x;
		qx[i] = p + x;  qy[i] = p - x; 
		adj[lower_bound(xp + 1, xp + xn + 1, qx[i]) - xp][lower_bound(yp + 1, yp + yn + 1, qy[i]) - yp].push_back(i); 
	}
	for(int i = 1; i <= xn; i++){
		stktop = 0; 
		for(int j = yn; j >= 1; j--){
			addLine(wr[i - 1][j], dp[i][j]); 
			int siz = adj[i][j].size(); 
			//for(int k = 1; k <= stktop; k++) cout << stk[k].k << "x+" << stk[k].b << " ";  cout << endl; 
			for(int k = 0; k < siz; k++){
				//cout << "(" << i << "," << j << ") " << adj[i][j][k] << endl; 
				ans[adj[i][j][k]] = max(ans[adj[i][j][k]], qMax(xp[i] - qx[adj[i][j][k]])); 
			}
		}
	}
	for(int j = 1; j <= yn; j++){
		stktop = 0; 
		for(int i = xn; i >= 1; i--){
			addLine(wu[i][j - 1], dp[i][j]); 
			int siz = adj[i][j].size(); 
			for(int k = 0; k < siz; k++) ans[adj[i][j][k]] = max(ans[adj[i][j][k]], qMax(yp[j] - qy[adj[i][j][k]])); 
		}
	}
	for(int i = 1; i <= q; i++) cout << ans[i] << '\n'; 

	return 0; 
}