#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)

using std::cin;
using std::cout;
using std::vector;
using std::queue;

int main() {
	int n, m;
	cin >> n >> m;
	
	vector<vector<int>> to(n); 
	vector<int> deg(n);
	rep(i, m) {
		int a, b;
		cin >> a >> b;
		--a; --b;
		to[a].push_back(b);
		to[b].push_back(a);
		deg[a]++;
		deg[b]++;
	}
	
	queue<int> q;
	rep(i, n) if (deg[i] == 1) q.push(i);
	
	int ans = 0;
	while (!q.empty()) {
		int u = q.front();
		if (deg[u] == 0) {
			q.pop();
			continue;
		}
		++ans;
		q.pop();
		for (int v : to[u]) {
			deg[v]--;
			if (deg[v] == 1) 
			   q.push(v);
		}
	}
	
	if (ans % 2 == 1) puts("Yes");
	else puts("No");
	
	return 0;
}