#include<stdio.h>
#include<string.h>
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;

const int maxn=60003;
int C,S;
struct Node{
	int Max,Lazy;//当前已售最大票数,延时记录
	Node(){Max=Lazy=0;}
}a[maxn<<2];

void Update(int rt)//Lazy传递
{
	int lz=a[rt].Lazy;
	a[rt<<1].Max+=lz;a[rt<<1].Lazy+=lz;
	a[rt<<1|1].Max+=lz;a[rt<<1|1].Lazy+=lz;
	a[rt].Lazy=0;//Lazy清零
}
int Qmax(int o,int d,int rt,int l,int r)//求已售最大票数
{
	if(o<=l&&d>=r)return a[rt].Max;
	if(a[rt].Lazy>0)Update(rt);//查询时Lazy向下传递
	int mid=(l+r)>>1;
	int u1=0,u2=0;
	//只要区间包含子树的一部分,就递归
	if(o<=mid)u1=Qmax(o,d,lson);
	if(d>mid)u2=Qmax(o,d,rson);
	return u1>u2?u1:u2;
}
void Insert(int o,int d,int n,int rt,int l,int r)//插入
{
	if(o<=l&&d>=r){a[rt].Max+=n;a[rt].Lazy+=n;return;}
	if(a[rt].Lazy>0)Update(rt);//插入前先考虑Lazy向下传递
	int mid=(l+r)>>1;
	if(o<=mid)Insert(o,d,n,lson);
	if(d>mid)Insert(o,d,n,rson);
	a[rt].Max=(a[rt<<1].Max>a[rt<<1|1].Max?a[rt<<1].Max:a[rt<<1|1].Max);
}
int main()
{
	freopen("railway.in","r",stdin);
	freopen("railway.out","w",stdout);
	int R;
	scanf("%d%d%d",&C,&S,&R);
	for(int i=1;i<=R;++i)
	{
		int o,d,n;
		scanf("%d%d%d",&o,&d,&n);
		int maxx=Qmax(o,d-1,1,1,C-1);
		if(maxx+n<=S)//申请成功,插入
		{
			puts("YES");
			Insert(o,d-1,n,1,1,C-1);
		}
		else puts("NO");
	}
	fclose(stdin);fclose(stdout);
	return 0;
}