#include <stdio.h>

// O(N^3) time
int solve_adj_mat()
{
	int i, N, M, u, w;
	char adj[5001][5001] = {};
	scanf("%d %d", &N, &M);
	for (i = 0; i < M; i++) {
		scanf("%d %d", &u, &w);
		adj[u][w] = 1;
		adj[w][u] = 1;
	}
	
	int ans = 0, tmp;
	while (1) {
		for (u = 1; u <= N; u++) {
			for (w = 1, tmp = 0; w <= N; w++) tmp += adj[u][w];
			if (tmp == 1) break;
		}
		if (u > N) break;
		ans ^= 1;
		for (w = 1; w <= N; w++) {
			if (adj[u][w] == 0) continue;
			adj[u][w] = 0;
			adj[w][u] = 0;
		}
	}
	return ans;
}

int main()
{
	if (solve_adj_mat() == 1) printf("Yes\n");
	else printf("No\n");
	fflush(stdout);
	return 0;
}