use std::collections::HashSet;


fn main() {
    let mut nm = String::new();
    std::io::stdin().read_line(&mut nm).ok();
    let nm: Vec<usize> = nm.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let n = nm[0];
    let m = nm[1];
    let mut paths = vec![HashSet::new(); n];
    for _ in 0..m {
        let mut ab = String::new();
        std::io::stdin().read_line(&mut ab).ok();
        let ab: Vec<usize> = ab.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
        let a = ab[0]-1;
        let b = ab[1]-1;
        paths[a].insert(b);
        paths[b].insert(a);
    }

    let mut mapping = vec![HashSet::new(); n];
    for &u in paths[0].iter() {
        for &v in paths[u].iter() {
            if v != 0 {
                mapping[v].insert(u);
            }
        }
    }
    for i in 0..n {
        if mapping[i].is_empty() { continue; }
        for &j in paths[i].iter() {
            if mapping[i].len() > 2 && mapping[j].len() > 2 {
                println!("YES");
                return;
            } else {
                for &k in mapping[i].iter() {
                    for &l in mapping[j].iter() {
                        if k != j && k != l && l != i && j != l {
                            println!("YES");
                            return;
                        }
                    }
                }
            }
        }
    }
    println!("NO");
}