#line 1 "a.cpp"
#include<iostream>
#include<algorithm>
using namespace std;
#line 1 "/home/kotatsugame/library/graph/MCF.cpp"
//Minimum Cost Flow O(FE log V)
//Minimum Cost Flow with negative cost O(NE+FE log V)
#line 4 "/home/kotatsugame/library/graph/MCF.cpp"
#include<utility>
#include<vector>
#include<queue>
#include<limits>
#include<cassert>
template<typename T>
struct MCF{
	struct edge{
		int to,rev,cap;
		T cost;
	};
	int n;
	bool negedge,ok;
	vector<vector<edge> >G;
	vector<T>h,d;
	vector<int>pv,pe;
	MCF(int n_=0):n(n_),negedge(false),G(n_),h(n_),d(n_),pv(n_),pe(n_){}
	void add_edge(int from,int to,int cap,T cost)
	{
		if(cost<0)negedge=true;
		G[from].push_back({to,(int)G[to].size(),cap,cost});
		G[to].push_back({from,(int)G[from].size()-1,0,-cost});
	}
	T min_cost_flow(int s,int t,int f)//ans or -1
	{
		ok=false;
		if(negedge)
		{
			fill(h.begin(),h.end(),numeric_limits<T>::max());
			h[s]=0;
			for(int tm=0;tm<n;tm++)
			{
				bool ch=false;
				for(int i=0;i<n;i++)if(h[i]<numeric_limits<T>::max())
				{
					for(const edge&e:G[i])
					{
						if(e.cap>0&&h[e.to]>h[i]+e.cost)
						{
							h[e.to]=h[i]+e.cost;
							ch=true;
						}
					}
				}
				if(!ch)break;
				assert(tm<n-1);//negative cycle
			}
		}
		T ret=0;
		while(f>0)
		{
			priority_queue<pair<T,int>,vector<pair<T,int> >,greater<pair<T,int> > >P;
			fill(d.begin(),d.end(),numeric_limits<T>::max());
			d[s]=0;
			P.push(make_pair(0,s));
			while(!P.empty())
			{
				pair<T,int>p=P.top();P.pop();
				if(d[p.second]<p.first)continue;
				for(int i=0;i<G[p.second].size();i++)
				{
					edge&e=G[p.second][i];
					if(e.cap>0&&d[e.to]>d[p.second]+e.cost+h[p.second]-h[e.to])
					{
						d[e.to]=d[p.second]+e.cost+h[p.second]-h[e.to];
						pv[e.to]=p.second;
						pe[e.to]=i;
						P.push(make_pair(d[e.to],e.to));
					}
				}
			}
			if(d[t]==numeric_limits<T>::max())return -1;
			for(int u=0;u<G.size();u++)h[u]+=d[u];
			int d=f;
			for(int u=t;u!=s;u=pv[u])d=min(d,G[pv[u]][pe[u]].cap);
			f-=d;
			ret+=d*h[t];
			for(int u=t;u!=s;u=pv[u])
			{
				G[pv[u]][pe[u]].cap-=d;
				G[u][G[pv[u]][pe[u]].rev].cap+=d;
			}
		}
		ok=true;
		return ret;
	}
	operator bool()const{return ok;}
};
#line 5 "a.cpp"
int N;
long M;
int A[3000],B[3000],C[3000];
main()
{
	cin>>N>>M;
	vector<pair<int,int> >mx(N),mi(N);
	for(int i=0;i<N;i++)
	{
		cin>>A[i]>>B[i]>>C[i];
		if(A[i]>C[i])swap(A[i],C[i]);
		mx[i]=make_pair(C[i],i);
		mi[i]=make_pair(A[i],i);
	}
	MCF<long>P(N*4+2);
	int st=N*4,go=st+1;
	sort(mx.begin(),mx.end());
	sort(mi.begin(),mi.end());
	for(int i=1;i<N;i++)
	{
		P.add_edge(N+mx[i].second,N+mx[i-1].second,N,0);
		P.add_edge(N+N+mi[i-1].second,N+N+mi[i].second,N,0);
	}
	for(int i=0;i<N;i++)
	{
		int mid=lower_bound(mi.begin(),mi.end(),make_pair(B[i],N))-mi.begin();
		if(mid<N)P.add_edge(i,N+N+mi[mid].second,1,0);
		int mxd=lower_bound(mx.begin(),mx.end(),make_pair(B[i],0))-mx.begin();
		if(mxd>0)P.add_edge(i,N+mx[mxd-1].second,1,-B[i]);
	}
	for(int i=0;i<N;i++)
	{
		P.add_edge(st,i,1,0);
		P.add_edge(N+i,3*N+i,1,0);
		P.add_edge(N+N+i,3*N+i,1,-C[i]);
		P.add_edge(3*N+i,go,1,0);
	}
	long ans=-P.min_cost_flow(st,go,N);
	if(P)
	{
		cout<<"YES"<<endl;
		if(ans>=M)cout<<"KADOMATSU!"<<endl;
		else cout<<"NO"<<endl;
	}
	else cout<<"NO"<<endl;
}