#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <deque>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <cassert>
#include <iostream>
#include <stdio.h>
#include <time.h>
 
using namespace std;

typedef long long ll;
 
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=b-1LL;i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)

#define MOD 1000000007

ll n,m;
vector<pair<ll,ll> > vac;
vector<ll> vb;

ll f(ll e){
  ll index = 0;
  ll ret = 0;
  vector<ll> v;
  priority_queue<pair<ll,ll> > pq;
  rep(i,-1,e+1){
    if(i<e){
      while(index<n&&vac[index].fi<=vb[i+1]){
        pq.push(mp(-vac[index].se,vac[index].fi));
        index++;
      }
    }
    else{
      while(index<n){
        pq.push(mp(-vac[index].se,vac[index].fi));
        index++;
      }      
    }
    while(pq.sz>i+1){
      pair<ll,ll> p = pq.top();pq.pop();
      v.pb(-p.fi);
    }
  }
  if(pq.sz<e+1)return -1;
  sort(all(v));
  ll flag = 1;
  rep(i,0,v.sz){
    ret += vb[e+1+i];
    if(v[i]>=vb[e+1+i])flag=0;
  }
  if(flag==0)return -1;
  while(!pq.empty()){
    pair<ll,ll> p = pq.top();pq.pop();
    ret += -p.fi;
  }
  return ret;
}

int main(){
  cin>>n>>m;
  rep(i,0,n){
    ll a,b,c;
    cin>>a>>b>>c;
    if(a>c)swap(a,c);
    vac.pb(mp(a,c));
    vb.pb(b);
  }
  vb.pb(1000000100);
  sort(all(vac));
  sort(all(vb));
  ll mx = -1;
  rep(i,-1,n){
    mx = max(mx,f(i));
  }
  if(mx!=-1){
    cout << "YES" << endl;
    if(mx>=m){
      cout << "KADOMATSU!" << endl;
    }
    else{
      cout << "NO" << endl;
    }
  }
  else{
    cout << "NO" << endl;
  }
  return 0;
}