#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define all(V) V.begin(),V.end()
typedef unsigned int uint;
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = DBL_EPSILON;
constexpr double PI=3.141592653589793238462643383279;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
	if (lhs < rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
	if (lhs > rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
inline lint gcd(lint a, lint b) {
	while (b) {
		lint c = a;
		a = b; b = c % b;
	}
	return a;
}
inline lint lcm(lint a, lint b) {
	return a / gcd(a, b) * b;
}
bool isprime(lint n) {
	if (n == 1)return false;
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0)return false;
	}
	return true;
}
template<typename T>
T mypow(T a, lint b) {
	T res(1);
	while(b){
		if(b&1)res*=a;
		a*=a;
		b>>=1;
	}
	return res;
}
lint modpow(lint a, lint b, lint m) {
	lint res(1);
	while(b){
		if(b&1){
			res*=a;res%=m;
		}
		a*=a;a%=m;
		b>>=1;
	}
	return res;
}
template<typename T>
void printArray(std::vector<T>& vec) {
	rep(i, vec.size()){
		std::cout << vec[i];
		std::cout<<(i==(int)vec.size()-1?"\n":" ");
	}
}
template<typename T>
void printArray(T l, T r) {
	T rprev = std::prev(r);
	for (T i = l; i != rprev; i++) {
		std::cout << *i << " ";
	}
	std::cout << *rprev << std::endl;
}
LP extGcd(lint a,lint b) {
	if(b==0)return {1,0};
	LP s=extGcd(b,a%b);
	std::swap(s.first,s.second);
	s.second-=a/b*s.first;
	return s;
}
LP ChineseRem(const lint& b1,const lint& m1,const lint& b2,const lint& m2) {
	lint p=extGcd(m1,m2).first;
	lint tmp=(b2-b1)*p%m2;
	lint r=(b1+m1*tmp+m1*m2)%(m1*m2);
	return std::make_pair(r,m1*m2);
}
template<typename F>
inline constexpr decltype(auto) lambda_fix(F&& f){
	return [f=std::forward<F>(f)](auto&&... args){
		return f(f,std::forward<decltype(args)>(args)...);
	};
}
#line 3 "/Users/kaage/Desktop/ProgrammingWorkspace/library/graph/FordFulkerson.hpp"
class FordFulkerson{
	class edge{
	public:
		int to;
		lint cap;
		int rev;
	};
	int n;
	std::vector<std::vector<edge>> vec;
	std::vector<bool> used;
	lint dfs(int v,int t,lint f){
		if(v==t)return f;
		used[v]=true;
		for(edge& e:vec[v]){
			if(!used[e.to]&&e.cap>0){
				lint d=dfs(e.to,t,std::min(f,e.cap));
				if(d){
					e.cap-=d;
					vec[e.to][e.rev].cap+=d;
					return d;
				}
			}
		}
		return 0;
	}
public:
	FordFulkerson(int n):n(n){
		vec.resize(n);
		used.resize(n);
	}
	void add_edge(int from,int to,lint cap){
		vec[from].push_back({to,cap,(int)vec[to].size()});
		vec[to].push_back({from,0,(int)vec[from].size()-1});
	}
	lint max_flow(int s,int t){
		lint res=0;
		while(true){
			used.assign(n,false);
			lint f=dfs(s,t,LINF);
			if(!f)return res;
			res+=f;
		}
	}
};
#line 3 "main.cpp"
int N,M,count[100010],memo[100010];
std::vector<int> vec[100010];
bool used[100010];
int main(){
	std::cin>>N>>M;
	FordFulkerson ff(N+1);
	rep(i,M){
		int a,b;
		std::cin>>a>>b;
		count[a]++;count[b]++;
		vec[a].emplace_back(b);
		vec[b].emplace_back(a);
		ff.add_edge(a,b,1);
		ff.add_edge(b,a,1);
	}
	REP(i,N){
		memo[i]=count[i];
		if(count[i]&1){
			puts("No");
			return 0;
		}
	}
	std::sort(count+1,count+N+1);
	if(count[N]>=6)puts("Yes");
	else if(N>=3&&count[N]==4&&count[N-1]==4&&count[N-2]==4)puts("Yes");
	else if(N>=2&&count[N]==4&&count[N-1]==4){
		int a=-1,b=-1;
		REP(i,N){
			if(memo[i]==4){
				if(a==-1)a=i;
				else b=i;
			}
		}
		if(ff.max_flow(a,b)==2)puts("Yes");
		else puts("No");
	}
	else puts("No");
	return 0;
}

Measured memory_bytes: 25076