//by yjz
#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
#ifndef LOCAL
#define cerr if(0)cout
#endif
typedef long long ll;
const int mod = 1e9+7;
//My i/o stream
struct fastio
{
	char s[100000];
	int it, len;
	fastio() {it=len=0;}
	inline char get()
	{
		if (it<len) return s[it++]; it=0;
		len=fread(s, 1, 100000, stdin);
		if (len==0) return EOF; else return s[it++];
	}
	bool notend()
	{
		char c=get();
		while (c==' '||c=='\n') c=get();
		if (it>0) it--;
		return c!=EOF;
	}
}_buff;
#define geti(x) x=getnum()
#define getii(x,y) geti(x),geti(y)
#define getiii(x,y,z) getii(x,y),geti(z)
#define puti(x) putnum(x),putchar(' ')
#define putii(x,y) puti(x),puti(y)
#define putiii(x,y,z) putii(x,y),puti(z)
#define putsi(x) putnum(x),putchar('\n')
#define putsii(x,y) puti(x),putsi(y)
#define putsiii(x,y,z) putii(x,y),putsi(z)
inline ll getnum()
{
	ll r=0; bool ng=0; char c; c=_buff.get();
	while (c!='-'&&(c<'0'||c>'9')) c=_buff.get();
	if (c=='-') ng=1, c=_buff.get();
	while (c>='0'&&c<='9') r=r*10+c-'0', c=_buff.get();
	return ng?-r:r;
}
template <class T> inline void putnum(T x)
{
	if (x<0) putchar('-'), x=-x;
	register short a[20]={}, sz=0;
	while (x) a[sz++]=x%10, x/=10;
	if(sz==0) putchar('0');
	for (int i=sz-1; i>=0; i--) putchar('0'+a[i]);
}
inline char getreal() {char c=_buff.get(); while (c<=32) c=_buff.get(); return c;}
ll qpow(ll x, ll k) {return k==0? 1: 1ll*qpow(1ll*x*x%mod,k>>1)*(k&1?x:1)%mod;}
int n, m;
const int maxn = 100111;
vector<int> con[maxn];
void add_edge(int x, int y)
{
	con[x].PB(y);
}
bool vis[maxn];
int fa[maxn];
vector<int> v;
bool dfs(int x, int pre=-1)
{
	vis[x] = 1;
	int f = 0;
	for (auto u : con[x])
	{
		if (u==pre&&!f)
		{
			f = 1;
			continue;
		}
		if (!vis[u])
		{
			fa[u] = x;
			if (dfs(u, x)) return true;
		}
		else
		{
			int i = x;
			v.PB(x);
			while (x!=u)
			{
				x = fa[x];
				v.PB(x);
			}
			return true;
		}
	}
	return true;
}

void del_edge(int x, int y)
{
	for (int i=0; i<con[x].size(); i++)
	{
		if (con[x][i]==y)
		{
			swap(con[x][i], con[x].back());
			con[x].pop_back();
			break;
		}
	}
	for (int i=0; i<con[y].size(); i++)
	{
		if (con[y][i]==x)
		{
			swap(con[y][i], con[y].back());
			con[y].pop_back();
		}
	}
}

vector<int> find_cycle()
{
	memset(vis, 0, sizeof(vis));
	v.clear();
	for (int i=1; i<=n; i++)
	{
		if (con[i].size()>0)
		{
			if (dfs(i)) break;
		}
	}
	for (int i=0; i<v.size(); i++) del_edge(v[i], v[(i+1)%v.size()]);
	return v;
}
int main()
{
	getii(n, m);
	for (int i=1; i<=m; i++)
	{
		int x, y;
		getii(x, y);
		add_edge(x, y);
		add_edge(y, x);
	}
	for (int i=1; i<=n; i++) if (con[i].size()%2!=0)
	{
		puts("No");
		return 0;
	}
	vector<int> C0 = find_cycle();
	vector<int> C1 = find_cycle();
//	for (auto x : C0) cerr<<x<<" "; cerr<<endl;
//	for (auto x : C1) cerr<<x<<" "; cerr<<endl;
	
	for (int i=1; i<=n; i++) if (con[i].size()>0)
	{
		puts("Yes");
		return 0;
	}
	if (C1.size()==0)
	{
		puts("No");
		return 0;
	}
	int cnt = 0;
	static bool hs[maxn];
	for (auto x : C0) hs[x]++;
	for (auto x : C1)
	{
		if (hs[x]) cnt++;
	}
	if (cnt>=3) puts("Yes"); else puts("No");
	return 0;
}


Measured memory_bytes: 11392