#include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define fi first
#define se second
#define eb emplace_back
#define popc __builtin_popcount
#define sgn(x) ((x)&1?-1:1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef unsigned long long ull;
typedef long double ld;

int read() {
    int x=0,w=1; char c=getchar(); 
    while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
    while(isdigit(c)) {x=x*10+c-'0'; c=getchar();}
    return x*w;
}

const int N=1e5+9,lim=1e9;

int n,m,s[N],t[N],a[N],b[N],c[N],ans[N];
struct node {int id,tp,x,y;} f[N<<1];
bool cmp(const node &a,const node &b) {return a.x==b.x?(a.tp<b.tp):(a.x>b.x);}

namespace SegT {
    int ls[N<<5],rs[N<<5],tot=1,s[N<<1],rt=1;
    void init() {
        rep(i,1,tot) ls[i]=rs[i]=s[i]=0;
        tot=rt=1;
    }
    void insert(int &p,int l,int r,int x) {
        if(!p) p=++tot; s[p]++; if(l==r) return; int mid=l+r>>1;
        if(x<=mid) insert(ls[p],l,mid,x); else insert(rs[p],mid+1,r,x);
    }
    int leq(int p,int l,int r,int x) {
        if(!p) return 0; if(l==r) return s[p]; int mid=l+r>>1;
        if(x<=mid) return leq(ls[p],l,mid,x); else return s[ls[p]]+leq(rs[p],mid+1,r,x);
    }
    int geq(int p,int l,int r,int x) {
        if(!p) return 0; if(l==r) return s[p]; int mid=l+r>>1;
        if(x<=mid) return s[rs[p]]+geq(ls[p],l,mid,x); else return geq(rs[p],mid+1,r,x);
    }
}

void work() {
    SegT::init();
    sort(f+1,f+n+m+1,cmp);
    rep(i,1,n+m) {
        if(f[i].tp==0) SegT::insert(SegT::rt,0,lim,f[i].y);
        else if(f[i].tp==1) ans[f[i].id]+=SegT::geq(SegT::rt,0,lim,f[i].y);
        else if(f[i].tp==2) ans[f[i].id]+=SegT::leq(SegT::rt,0,lim,f[i].y);
        else if(f[i].tp==3) ans[f[i].id]-=SegT::leq(SegT::rt,0,lim,f[i].y);
        else assert(0);
    }
}

signed main() {
    n=read(), m=read();
    rep(i,1,n) s[i]=read(), t[i]=read();
    rep(i,1,m) a[i]=read(), b[i]=read(), c[i]=max(read(),a[i]+b[i]);
    rep(i,1,n) f[i]=(node){i,0,s[i],s[i]+t[i]};
    rep(i,1,m) f[i+n]=(node){i,1,a[i],c[i]};
    work();
    rep(i,1,n) f[i]=(node){i,0,s[i],s[i]+t[i]};
    rep(i,1,m) f[i+n]=(node){i,2,c[i]-b[i]+1,c[i]-1};
    work();
    rep(i,1,n) f[i]=(node){i,0,s[i],t[i]};
    rep(i,1,m) f[i+n]=(node){i,3,c[i]-b[i]+1,b[i]-1};
    work();
    rep(i,1,m) printf("%lld\n",ans[i]);
}