#include <iostream>
#include <fstream>
#include <cmath>  
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string> 
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <random>
#include <chrono>

using namespace std;

using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll LLINF = (ll)1e18;
const ll INTINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;

template <class T> void corner(bool flg, T hoge) { if (flg) { cout << hoge << endl; exit(0); } }
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) { o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o; }
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) { o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o; }
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) { o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o; }
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) { o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o; }
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) { o << "{" << obj.first << ", " << obj.second << "}"; return o; }
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) { o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o; }
void print(void) { cout << endl; }
template <class Head> void print(Head&& head) { cout << head; print(); }
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { cout << head << " "; print(forward<Tail>(tail)...); }
template <class T> void chmax(T& a, const T b) { a = max<T>(a, b); }
template <class T> void chmin(T& a, const T b) { a = min<T>(a, b); }
void YN(bool flg) { cout << ((flg) ? "YES" : "NO") << endl; }
void Yn(bool flg) { cout << ((flg) ? "Yes" : "No") << endl; }
void yn(bool flg) { cout << ((flg) ? "yes" : "no") << endl; }

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N,M; cin >> N >> M;
	V<V<P<int,int>>> edge(N);
	V<int> node(N,0);
	for(int i = 0; i < M; ++i){
		int a, b; cin >> a >> b;
		a--, b--;
		edge[a].push_back({b,i});
		edge[b].push_back({a,i});
		node[a]++;
		node[b]++;
	}
	for (int i = 0; i < N; ++i) corner(node[i] % 2, "No");
	for (int i = 0; i < N; ++i) corner(node[i] >=6, "Yes");
	V<int> cnt4;
	for (int i = 0; i < N; ++i) if(node[i] == 4) cnt4.push_back(i);
	corner(cnt4.size() < 2, "No");
	corner(cnt4.size() > 2, "Yes");

	int l = cnt4[0], r = cnt4[1], cnt = 0;
	V<int> flg(M, 0),d;
	stack<P<int,int>> q;
	q.push({l,-1});
	q.push({ l,-1 });

	while(q.size()){
		int from = q.top().first;
		int c = q.top().second;
		q.pop();

		if (from == l && c != -1) {
			d.push_back(c);
			continue;
		}
		if (from == l || from == r) c++;
		
		for(auto e:edge[from]){
			if (flg[e.second]) continue;
			flg[e.second] = 1;
			q.push({e.first,c});
			break;
		}
	}
	Yn(d[0] == 0 || d[1] == 0);
	return 0;
}


Measured memory_bytes: 6528