#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctime>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
//const int mod = 1e9 + 7;
const int mod = 998244353;

struct FF{
    struct edge{
        int to, cap, rev;
    };
    vector<vector<edge>> G;
    vector<bool> used;
    int n;
 
    FF(int N): n(N),G(N),used(N){}
 
    void add_edge(int from, int to, int cap){
        G[from].push_back({to,cap,(int)G[to].size()});
        G[to].push_back({from,0,(int)G[from].size()-1});
    }
 
    int dfs(int u, int t, int f){
        if(u == t) return f;
        used[u] = true;
        for(auto &e : G[u]){
            if(!used[e.to] && e.cap > 0){
                int d = dfs(e.to, t, min(f, e.cap));
                if(d > 0){
                    e.cap -= d;
                    G[e.to][e.rev].cap += d;
                    return d;
                }
            }
        }
        return 0;
    }
 
    int max_flow(int s, int t){
        int flow = 0;
        while(1){
            rep(i,n) used[i] = false;
            int f = dfs(s, t, inf);
            if(f == 0) return flow;
            flow += f;
        }
    }
};

int main(){
    ll n,m; cin >> n >> m;
    vvl G(n);
    rep(i,m){
        ll u,v; cin >> u >> v; u--; v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    if(m < n+2){
        puts("No");
        return 0;
    }
    int cnt = 0;
    vl ls;
    rep(i,n){
        if((int)G[i].size() & 1){
            puts("No");
            return 0;
        }
    }
    rep(i,n){
        if((int)G[i].size() >= 6){
            puts("Yes");
            return 0;
        }
        if((int)G[i].size() == 4) cnt++, ls.push_back(i);
    }
    if(cnt >= 3){
        puts("Yes");
    }else{
        FF ff(n);
        rep(u,n){
            for(auto v : G[u]){
                ff.add_edge(u,v,1);
            }
        }
        if(ff.max_flow(ls[0], ls[1]) == 2){
            puts("Yes");
        }else{
            puts("No");
        }
    }
}

Measured memory_bytes: 19048