#include<iostream>
#include<cstdio>
#include<cstring>
#include<cctype>
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
int tree[250000];
int lazy[250000];
void Build(int,int,int,int,int,int);
int Find(int,int,int,int,int);
void Update(int);
int main()
{
	freopen("railway.in","r",stdin);
	freopen("railway.out","w",stdout);
	memset(tree,0,sizeof(tree));
	memset(lazy,0,sizeof(tree));
	int C,S,R;
	cin>>C>>S>>R;
	for(int i=1;i<=R;i++)
	{
		int a,b,c;
		cin>>a>>b>>c;
		int k=Find(a,b-1,1,1,C-1);
		if(c+k<=S){
		cout<<"YES"<<endl;
		Build(a,b-1,c,1,1,C-1);
		}
		else cout<<"NO"<<endl;
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
}
void Build(int s,int t,int x,int rt,int l,int r)
{
    if(s<=l&&t>=r){tree[rt]+=x;lazy[rt]+=x;return;}
    int mid=(l+r)>>1;
    if(s<=mid)Build(s,t,x,lson);
    if(t>mid)Build(s,t,x,rson);
    if(tree[rt<<1]>=tree[rt<<1|1])tree[rt]=tree[rt<<1];
    else tree[rt]=tree[rt<<1|1];
}
int Find(int s,int t,int rt,int l,int r)
{
	if(s<=l&&t>=r)return tree[rt];
	if(lazy[rt])Update(rt);
	int mid=(l+r)>>1;
	if(t<=mid)return Find(s,t,lson);
	if(s>mid)return Find(s,t,rson);
    return Find(s,t-1,lson)>Find(s,t,rson)?Find(s,t,lson):Find(s,t,rson);
}
void Update(int rt)
{
	tree[rt<<1]+=lazy[rt];
	lazy[rt<<1]+=lazy[rt];
	tree[rt<<1|1]+=lazy[rt];
	lazy[rt<<1|1]+=lazy[rt];
	lazy[rt]=0;
}