#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[allow(unused_imports)]
use std::io::stdin;
mod util {
    use std::io::stdin;
    use std::str::FromStr;
    use std::fmt::Debug;
    #[allow(dead_code)]
    pub fn line() -> String {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().to_string()
    }
    #[allow(dead_code)]
    pub fn gets<T: FromStr>() -> Vec<T>
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.split_whitespace()
            .map(|t| t.parse().unwrap())
            .collect()
    }
}
#[allow(unused_macros)]
macro_rules ! get { ( $ t : ty ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . trim ( ) . parse ::<$ t > ( ) . unwrap ( ) } } ; ( $ ( $ t : ty ) ,* ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; let mut iter = line . split_whitespace ( ) ; ( $ ( iter . next ( ) . unwrap ( ) . parse ::<$ t > ( ) . unwrap ( ) , ) * ) } } ; ( $ t : ty ; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ ( $ t : ty ) ,*; $ n : expr ) => { ( 0 ..$ n ) . map ( | _ | get ! ( $ ( $ t ) ,* ) ) . collect ::< Vec < _ >> ( ) } ; ( $ t : ty ;; ) => { { let mut line : String = String :: new ( ) ; stdin ( ) . read_line ( & mut line ) . unwrap ( ) ; line . split_whitespace ( ) . map ( | t | t . parse ::<$ t > ( ) . unwrap ( ) ) . collect ::< Vec < _ >> ( ) } } ; }
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { println ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }

fn main() {
    let (n, m) = get!(usize, usize);

    if m >= (n - 1) && m <= (n / 2) * ((n + 1) / 2) {
        let mut g = vec![BTreeSet::new(); n];

        for i in 0..n / 2 {
            g[i].insert(n / 2);
            g[n / 2].insert(i);
        }

        for i in n / 2 + 1..n {
            g[i].insert(0);
            g[0].insert(i);
        }

        let mut rest = m - (n - 1);
        'outer: for i in 0..n / 2 {
            for j in n / 2..n {
                if !g[i].contains(&j) {
                    g[i].insert(j);
                    g[j].insert(i);
                    rest -= 1;
                    if rest == 0 {
                        break 'outer;
                    }
                }
            }
        }

        let e = g.iter()
            .enumerate()
            .flat_map(|(i, set)| {
                set.into_iter()
                    .map(|&j| (min(i, j), max(i, j)))
                    .collect::<Vec<_>>()
            })
            .collect::<BTreeSet<_>>();

        println!("YES");
        println!(
            "{}",
            (1..n + 1)
                .map(|i| i.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        );

        for &(f, t) in &e {
            println!("{} {}", f + 1, t + 1);
        }
    } else {
        println!("NO");
    }
}