#include <bits/stdc++.h>
using namespace std;

int n, m, a, b, t = 0;
set<int> e[5000];
queue<int> Q;

int main()
{
	cin >> n >> m;

	for (int i = 0; i < m; i++) {
		cin >> a >> b;

		a--;
		b--;
		e[a].insert(b);
		e[b].insert(a);
	}

	for (int i = 0; i < n; i++)
		if (e[i].size() == 1)
				Q.push(i);

	while (!Q.empty()) {
		int u = Q.front();
		Q.pop();
		
		if (e[u].size() == 1) {
			int v = *e[u].begin();

			e[v].erase(u);
			t++;

			if (e[v].size() == 1)
				Q.push(v);
		}
	}
	
	if (t & 1)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}