import std.algorithm;
import std.array;
import std.conv;
import std.range;
import std.stdio;
import std.string;
import std.typecons;

bool solve (int n, int m, int [] d)
{
	if (d.any !(x => x & 1))
	{
		return false;
	}
	return m >= n + 2 && m >= 9;
}

void main ()
{
	int n, m;
	while (readf (" %s %s", &n, &m) > 0)
	{
		auto d = new int [n];
		foreach (j; 0..m)
		{
			int u, v;
			readf (" %s %s", &u, &v);
			u -= 1;
			v -= 1;
			d[u] += 1;
			d[v] += 1;
		}
		writeln (solve (n, m, d) ? "Yes" : "No");
	}
}
