#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

int N, M;
vector<int> G[MAX_N];
bool used[MAX_N];
int low[MAX_N], ord[MAX_N];

void lowlink(int at, int p, int &k) {
//int &k can be altered as int k
//used this as lowlink(0, -1, k). declare int k = 0
//if(ord[at] < low[n]) (n, at) is a bridge
//if(at == 0) if(nG[at].size() > 1) at  is an articulation point
//else if(ord[at] <= low[n]) at  is an articulation point
	used[at] = true;
	low[at] = ord[at] = k;
	k++;
	for(int i = 0; i < (int)G[at].size(); i++) {
		int n = G[at][i];
		if(!used[n]) {
			lowlink(n, at, k);
			low[at] = min(low[at], low[n]);
		}
		else if(n != p) low[at] = min(low[at], ord[n]); //if you set unreachable vertex, be careful here.
	}
}

/*
vector<pi> ans;

int dfs(int at) { //return num of bridges
	used[at] = true;
	int res = 0;
	for(int i = 0; i < G[at].size(); i++) {
		int n = G[at][i];
		if(used[n]) continue;
		if(ord[at] < low[n]) {
			ans.push_back(pi(at, n));
			res++;
		}
		res += dfs(n);
	}
	return res;
}
*/

vector<int> ans; 

int dfs(int at) { //return num of articulation points
	used[at] = true;
	bool tmp = false;
	int cnt = 0, res = 0;
	for(int i = 0; i < (int)G[at].size(); i++) {
		int n = G[at][i];
		if(used[n]) continue;
		if(at != 0 && ord[at] <= low[n] && !tmp) {
			ans.push_back(at);
			tmp = true;
			res++;
		}
		res += dfs(n);
		cnt++;
	}
	if(at == 0 && cnt > 1) {
		ans.push_back(0);
		res++;
	}
	return res;
}

int deg[MAX_N];

void solve() {
	cin >> N >> M;
	rep(i, 0, M) {
		int a, b; 
		cin >> a >> b; a--; b--;
		G[a].pb(b);
		G[b].pb(a);
		deg[a]++;
		deg[b]++;
	}
	int cnt = 0;
	rep(i, 0, N) {
		if(deg[i] % 2 != 0) {
			cout << "No\n";
			return;
		}
		if(deg[i] == 4) {
			cnt++;
		}
	}
	if(M - N >= 2) {
		int k = 0;
		lowlink(0, -1, k);
		memset(used, 0, sizeof(used));
		// cout << dfs(0) << "\n";
		if(M - N == 2 && cnt == 2 && dfs(0) == 0) {
			cout << "No\n";
		}
		else cout << "Yes\n";
	}
	else cout << "No\n";
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}



Measured memory_bytes: 18048