#include<iostream>  
#include<algorithm>  
#include<bits/stdc++.h>
using namespace std;
int n,m,zidan[20000],mubanb[20000],mubane[20000],mubans[20000];
//struct mu{int x1,x2,s;}muban[200000];
int main()
{
	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",&muban[i].x1,&muban[i].x2,&muban[i].s);}	
	{scanf("%d %d %d",&mubanb[i],&mubane[i],&mubans[i]);}
	for(int i=1;i<=m;++i)
	{	
		scanf("%d",&zidan[i]);
		int sum=0;
		for(int j=1;j<=n;++j)
		{
			if(mubans[j]>0)
			{
				if(mubanb[j]<=zidan[i]&&mubane[j]>=zidan[i])
				{mubans[j]--;}
				if(mubans[j]==0)sum++;
			}
		}
		printf("%d\n",sum);
	}
	return 0;
}