// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

fn run() {
    input! {
        n: usize,
        m: i64,
        p: [(i64, i64, i64); n],
    }
    let mut b = p.iter().map(|p| p.1).collect::<Vec<_>>();
    b.sort();
    let mut p = p.into_iter().map(|p| (p.0.min(p.2), p.0.max(p.2))).collect::<Vec<_>>();
    p.sort();
    let p = p;
    let mut ans: Option<i64> = None;
    for i in 0..=n {
        let (l, r) = b.split_at(i);
        let mut e = vec![];
        for l in l.iter() {
            e.push((*l, 1, 0));
        }
        for (k, &(a, _)) in p.iter().enumerate() {
            e.push((a, 0, k));
        }
        e.sort();
        let mut h = std::collections::BinaryHeap::<(i64, usize)>::new();
        let mut cnt = 0;
        let mut sum = 0;
        for (_, op, k) in e.into_iter().rev() {
            if op == 1 {
                if let Some((c, _k)) = h.pop() {
                    sum += c;
                    cnt += 1;
                }
            } else {
                h.push((p[k].1, k));
            }
        }
        let p = h.into_iter().map(|(_, k)| p[k].1).collect::<Vec<_>>();
        let mut e = vec![];
        for r in r.iter() {
            e.push((*r, 0));
        }
        for &c in p.iter() {
            e.push((c, 1));
        }
        e.sort();
        let mut stack = 0;
        for (c, op) in e {
            if op == 0 {
                if stack > 0 {
                    cnt += 1;
                    sum += c;
                    stack -= 1;
                }
            } else {
                stack += 1;
            }
        }
        if cnt == n {
            if ans.is_none() {
                ans = Some(sum);
            } else {
                let v = ans.unwrap();
                ans = Some(v.max(sum));
            }
        }
    }
    if let Some(ans) = ans {
        println!("YES");
        if ans >= m {
            println!("KADOMATSU!");
        } else {
            println!("NO");
        }
    } else {
        println!("NO");
    }
}

fn main() {
    run();
}