#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

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

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

fn dfs(v: usize, goal: usize, fb: usize,
       par: usize,
       g: &[Vec<usize>], vis: &mut [bool]) -> bool {
    if vis[v] {
        if v == goal {
            return true;
        }
    } else {
        if v == fb {
            return false;
        }
    }
    // eprintln!("v = {}, goal = {}, fb = {}", v, goal, fb);
    vis[v] = true;
    for &w in &g[v] {
        if w == par { continue; }
        if dfs(w, goal, fb, v, g, vis) {
            return true;
        }
    }
    false
}

fn calc(g: &[Vec<usize>]) -> bool {
    let n = g.len();
    for i in 0..n {
        if g[i].len() % 2 == 1 {
            return false;
        }
    }
    let mut four = 0;
    let mut fv = vec![];
    for i in 0..n {
        if g[i].len() >= 6 {
            return true;
        }
        if g[i].len() == 4 {
            four += 1;
            fv.push(i);
        }
    }
    if four >= 3 {
        return true;
    }
    if four <= 1 {
        return false;
    }
    assert_eq!(four, 2);
    let mut vis = vec![false; n];
    dfs(fv[0], fv[0], fv[1], n, &g, &mut vis)
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (write!(out,$($format)*).unwrap());
    }
    input! {
        n: usize,
        m: usize,
        ab: [(usize1, usize1); m],
    }
    let mut g = vec![vec![]; n];
    for &(a, b) in &ab {
        g[a].push(b);
        g[b].push(a);
    }
    puts!("{}\n", if calc(&g) { "Yes" } else { "No" });
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}


Measured memory_bytes: 18684