#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<cctype>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<time.h>
#define ll long long
using namespace std;
int n,m,sh[200003];
struct data{
	int lf,ri,t; 
}a[1003];
bool cmp(data a,data b)
{	return a.lf<b.lf;	}
void solve30()
{
	sort(a+1,a+1+n,cmp);//我大c党无敌╮(￣▽￣")╭ 
	for(int i=1;i<=m;i++)
	{
		int cnt=0;
		for(int j=1;j<=n;j++)
		{
			if(a[j].lf<=sh[i])
			{
				if(a[j].ri>=sh[i] && a[j].t>0)
				{
					--a[j].t;
					if(a[j].t==0)	++cnt;
				}
			}
			else	break;
		}
		printf("%d\n",cnt);
	}
}
int main()
{
	/*marrrx ia liubliu tibia*/
	freopen("shooting.in","r",stdin);
	freopen("shooting.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	scanf("%d%d%d",&a[i].lf,&a[i].ri,&a[i].t);
	for(int i=1;i<=m;i++)
	scanf("%d",sh+i);
	solve30();
	return 0;
}