#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (int i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}



template<class T>
using square_matrix=std::vector<std::vector<T>>;
template<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>
square_matrix<T> mul_matrix(square_matrix<T> l,square_matrix<T> r){
	int n=l.size();
	assert((int)l[0].size()==n&&(int)r.size()==n&&(int)r[0].size()==n);
	square_matrix<T> val(n,std::vector<T>(n,add_e()));
	for(int i=0;i<n;i++) for(int j=0;j<n;j++) for(int k=0;k<n;k++){
		val[i][k]=add_op(val[i][k],mul_op(l[i][j],r[j][k]));
	}
	return val;
}
template<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>
square_matrix<T> pow_matrix(square_matrix<T> l,long long times){
	int n=l.size();
	square_matrix<T> val(n,std::vector<T>(n,add_e()));
	for(int i=0;i<n;i++) val[i][i]=mul_e();
	while(times){
		if(times&1){
			val=mul_matrix<T,add_op,add_e,mul_op,mul_e>(val,l);
		}
		l=mul_matrix<T,add_op,add_e,mul_op,mul_e>(l,l);
		times>>=1;
	}
	return val;
}

using mat_F=bool;
mat_F add_op(mat_F a,mat_F b){
	return a|b;
}
mat_F add_e(){
	return 0;
}
mat_F mul_op(mat_F a,mat_F b){
	return a&b;
}
mat_F mul_e(){
	return 1;
}
#define calc mat_F,add_op,add_e,mul_op,mul_e



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll N,M;
	cin>>N>>M;
	vector<pair<ll,ll>> I(N);
	vector<ll> B(N);
	vector<int> p(N);
	vector<int> rev(N);
	iota(rev.begin(),rev.end(),0);
	rep(i,N){
		ll a,b,c;
		cin>>a>>b>>c;
		B[i]=b;
		if(a>c) swap(a,c);
		I[i]={a,c};
	}
	So(I),So(B);
	sort(rev.begin(),rev.end(),[&](int l,int r){
		return I[l].second<I[r].second;
	});
	ll ans=-INF;
	rep(i,N+1){
		int J=1;
		int x=N-1;
		priority_queue<pair<ll,int>> pq;
		ll tmp=0;
		for(int j=i-1;j>=0;j--){
			while(x>=0&&I[x].first>B[j]){
				pq.push({I[x].second,x});
				x--;
			}
			if(pq.empty()){
				J=0;
				break;
			}
			p[pq.top().second]=1;
			tmp+=pq.top().first;
			pq.pop();
		}
		if(J==0) continue;
		x=N-1;
		for(int j=N-1;j>=0;j--){
			if(p[rev[j]]){
				p[rev[j]]=0;
				continue;
			}
			if(I[rev[j]].second>=B[x]){
				J=0;
			}
			tmp+=B[x];
			x--;
		}
		if(J) chmax(ans,tmp);
	}
	if(ans==-INF){
		cout<<"NO\n";
	}else{
		cout<<"YES\n";
		if(ans>=M){
			cout<<"KADOMATSU!\n";
		}else cout<<"NO\n";
	}
}