#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif

//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = 1'000'000'007;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }

using Weight = int;
struct Edge {
	int s, d; Weight w;
	Edge() {};
	Edge(int s, int d, Weight w) : s(s), d(d), w(w) {};
};
bool operator<(const Edge &e1, const Edge &e2) { return e1.w < e2.w; }
bool operator>(const Edge &e1, const Edge &e2) { return e2 < e1; }
inline ostream &operator<<(ostream &os, const Edge &e) { return (os << '(' << e.s << ", " << e.d << ", " << e.w << ')'); }

using Edges = vector<Edge>;
using Graph = vector<Edges>;
using Array = vector<Weight>;
using Matrix = vector<Array>;

void addArc(Graph &g, int s, int d, Weight w = 1) {
	g[s].emplace_back(s, d, w);
}
void addEdge(Graph &g, int a, int b, Weight w = 1) {
	addArc(g, a, b, w);
	addArc(g, b, a, w);
}

//無向グラフがオイラーグラフか判定（オイラー閉路を持つ）
pair<bool, vector<int>> isEulerianGraph(const Graph &udg) {
	//if (!isConnectedGraph(udg))return false;
	int n = udg.size();
	vector<int> degree(n, 0);
	for (auto &es : udg)for (auto &e : es)
		degree[e.d]++, degree[e.s]++;
	bool ok = true;
	for (auto &d : degree) {
		d /= 2;
		if (d % 2)
			ok = false;
	}
	return make_pair(ok, degree);
}

//無向グラフが準オイラーグラフか判定（閉路でないオイラー路を持つ）
bool isSemiEulerianGraph(const Graph &udg) {
	//if (!isConnectedGraph(udg))return false;
	int n = udg.size();
	vector<int> degree(n, 0);
	for (auto &es : udg)for (auto &e : es) degree[e.d]++, degree[e.s]++;
	dump(degree);
	int odd = 0;
	for (auto &d : degree) {
		if ((d / 2) % 2)odd++;
		if (odd > 2)return false;
	}
	return odd == 2;
}

// 単純グラフで閉路があるかどうか
bool hasCycle(const Graph &g, int s = 0) {
	int n = g.size();
	vector<bool> vis(n);
	function<int(int, int)> dfs = [&](int u, int p) {
		bool ret = false;
		vis[u] = true;
		for (auto e : g[u]) {
			if (p == e.d)continue;
			if (vis[e.d])
				return true;
			ret |= dfs(e.d, u);
			if (ret)break;
		}
		return ret;
	};
	return dfs(s, -1);
}

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N, M; cin >> N >> M;
	vector<int> a(M), b(M); rep(i, 0, M) {
		cin >> a[i] >> b[i];
		a[i]--, b[i]--;
	}
	Graph g(N);
	rep(i, 0, M) {
		addEdge(g, a[i], b[i]);
	}
	dump(hasCycle(g));
	bool ok; vector<int> deg;
	tie(ok, deg) = isEulerianGraph(g);
	dump(ok, deg);
	if (ok) {
		int cnt = 0;
		int cnt4 = 0;
		for (auto d : deg) {
			cnt += (d - 2) / 2;
			if (d == 4)cnt4++;
		}
		if (cnt == 2 && cnt4 == 2) {
			bool yes = true;
			vector<int> v;
			rep(i, 0, N)if (deg[i] == 4)v.push_back(i);
			int k = 0;
			rep(i, 0, N) {
				if (deg[i] == 4) {
					Graph g2(N);
					rep(j, 0, M) {
						if (i == a[j] || i == b[j])
							continue;
						addEdge(g2, a[j], b[j]);
					}
					if (!hasCycle(g2, v[++k % 2])) {
						yes = false;
					}
				}
			}
			cout << (yes ? "Yes" : "No") << endl;
		}
		else if (cnt >= 2) {
			cout << "Yes" << endl;
		}
		else {
			cout << "No" << endl;
		}
	}
	else {
		cout << "No" << endl;
	}

	return 0;
}

Measured memory_bytes: 14328