#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define Ans(f, y, n) if(f) cout << y << endl; else cout << n << endl;
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i, v.size()){ cout << v[i] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i, m.size()){ REP(j, m[i].size()){ cout << m[i][j] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

template<typename T> void readv(vector<T> &a){ REP(i, a.size()) cin >> a[i]; }
void readv_m1(vector<int> &a){ REP(i, a.size()){cin >> a[i]; a[i]--;} }

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};

int mod = 1000000007;
//int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod

struct edge{int to, cost;};

class Graph
{
public:
    int N;
    vector<vector<edge>> G;

    Graph(int N): N(N){
        G = vector<vector<edge>>(N, vector<edge>(0));
    }

    void add_edge(int from, int to, int cost = 0){
        G[from].push_back(edge({to, cost}));
    }

    void add_edge2(int v1, int v2, int cost = 0){
        add_edge(v1, v2, cost);
        add_edge(v2, v1, cost);
    }

    bool dfs(int s, int t, int v, int p){
        if(v == s) return true;
        if(v == t) return false;
        for(auto e: G[v]) if(e.to != p) return dfs(s, t, e.to, v);
    }

};

signed main(){

    int N, M; cin >> N >> M;
    vec a(M), b(M);
    Graph G(N);
    REP(i, M){
        cin >> a[i] >> b[i];
        a[i]--; b[i]--;
        G.add_edge2(a[i], b[i]);
    }
    vec num(N);
    REP(i, N) num[i] = SZ(G.G[i]);
    //vdebug(num);

    bool f = true;
    int c = 0;
    vec v;
    REP(i, N){
        if(num[i] % 2) f = false;
        c += (num[i] - 2) / 2;
        if(num[i] >= 4) v.pb(i);
    }

    bool ans;
    if(f && c >= 3) ans = true;
    else if(f && c == 2){
        if(SZ(v) == 1) ans = true;
        else{
            int s = v[0], t = v[1];
            bool ok = false;
            for(auto e: G.G[s]) if(G.dfs(s, t, e.to, s)) ok = true;
            if(ok) ans = true;
            else ans = false;
            //assert(false);
        }
    }
    else ans = false;
    //assert(!ans || c >= 3);
    Ans(ans, "Yes", "No");

    return 0;
}


Measured memory_bytes: 10240