#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; ll m; cin >> n >> m;
  vector<pair<int, int>> ca(n);
  vector<int> b(n);
  REP(i, n) {
    int a, c; cin >> a >> b[i] >> c;
    if (a > c) swap(a, c);
    ca[i] = {c, a};
  }
  sort(ALL(ca), greater{});
  sort(ALL(b));
  ll ans = -1;
  auto f = [&](int m) -> ll {
    ll point = 0;
    priority_queue<pair<int, int>> que;
    int idx = 0;
    for (int i = m - 1; i >= 0; --i) {
      while (que.empty() || b[i] >= que.top().first) {
        if (idx == n) return -1;
        que.emplace(ca[idx].second, ca[idx].first);
        ++idx;
      }
      point += que.top().second;
      que.pop();
    }
    vector<int> c;
    while (!que.empty()) {
      c.emplace_back(que.top().second);
      que.pop();
    }
    for (; idx < n; ++idx) c.emplace_back(ca[idx].first);
    sort(ALL(c));
    FOR(i, m, n) {
      if (c[i - m] >= b[i]) return -1;
      point += b[i];
    }
    return point;
  };
  REP(m, n + 1) chmax(ans, f(m));
  if (ans == -1) {
    cout << "NO\n";
  } else {
    cout << "YES\n" << (ans >= m ? "KADOMATSU!\n" : "NO\n");
  }
  return 0;
}