#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<algorithm>
#include<cstdlib>
using namespace std;
typedef long long ll;
template <class E>inline void read(E &e){
	e=0;char c=getchar();bool eh=0;
	while(c>'9'||c<'0'){if(c=='-')eh=1;c=getchar();}
	while(c>='0'&&c<='9'){e=e*10+c-48;c=getchar();}
	if(eh) e=-e;
}
 
struct node{
	int x1,x2,sum;
}e[10000];
int main(){ 
	freopen("shooting.in","r",stdin);
	freopen("shooting.out","w",stdout); 
	int n,m;read(n);read(m);
	for(int i=1;i<=n;++i){
		read(e[i].x1);
		read(e[i].x2);
		read(e[i].sum);
	}
	for(int i=1;i<=m;++i){
		int x,ans=0;
		read(x);
		for(int i=1;i<=n;++i){
			if(e[i].x1<=x&&e[i].x2>=x){
				if(e[i].sum==1){
					ans++;
					e[i].sum=0;
				} 
				else e[i].sum--; 
			}
		}	
		printf("%d\n",ans);
	}
	return 0;
}