#include<bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN=2e5+1,INF=1e18+1;
int cnt,n,m,ans[MAXN];
class TreeArray {
	private:
		int tree[MAXN];
		inline int lowbit(int x){
			return x&(-x);
		}
	public:
		inline void Modify(int pos,int v) {
			for(register int i=pos;i<=n;i+=lowbit(i)) tree[i]+=v;
		}
		inline int Query(int pos) {
			int ans=0;
			for(register int i=pos;i;i-=lowbit(i)) ans+=tree[i];
			return ans;
		}
}	A;
struct node {
	int x,y,k,id,type;
	inline friend bool operator <(const node &a,const node &b) {
		return a.type<b.type;
	}
}	q[MAXN<<1],t1[MAXN<<1],t2[MAXN<<1];
void solve(int ql,int qr,int l,int r) {
	if(ql>qr||l>r) return ;
	if(l==r) {
		for(register int i=ql;i<=qr;++i) {
			if(q[i].type==1) ++ans[l]; 
		}
		return ;
	}
	int mid=(l+r)>>1,p1=0,p2=0;
	for(register int i=ql;i<=qr;++i) {
		if(q[i].type==1) {
			if(q[i].id<=mid) {
				A.Modify(q[i].k,1);
				t1[++p1]=q[i];
			} else t2[++p2]=q[i];
		} else {
			int res=A.Query(q[i].y)-A.Query(q[i].x-1);
			if(res>=q[i].k) t1[++p1]=q[i];
			else {
				q[i].k-=res;
				t2[++p2]=q[i];
			}
		}
	}
	for(register int i=1;i<=p1;++i) if(t1[i].type==1) A.Modify(t1[i].k,-1);
	for(register int i=1;i<=p1;++i) q[i+ql-1]=t1[i];
	for(register int i=1;i<=p2;++i) q[i+ql+p1-1]=t2[i];
	solve(ql,ql+p1-1,l,mid);
	solve(ql+p1,qr,mid+1,r);
	return ;
}
signed main() {
	scanf("%lld%lld",&n,&m);
	for(register int i=1;i<=n;++i) {
		int l,r,k;
		scanf("%lld%lld%lld",&l,&r,&k);
		q[++cnt]=(node){l,r,k,i,2};
	}
	for(register int i=1;i<=m;++i) {
		int s;
		scanf("%lld",&s);
		q[++cnt]=(node){-1,-1,s,i,1};
	}
	stable_sort(q+1,q+cnt+1);
	solve(1,cnt,1,INF);
	for(register int i=1;i<=m;++i) printf("%lld\n",ans[i]);
	return 0;
}