#include <stdio.h>

typedef struct List {
	struct List *next;
	int v;
} list;

// O(N + M) time
int solve_adj_list()
{
	int i, N, M, u, w, deg[100001] = {};
    list *adj[100001] = {}, e[400001], *p;
	scanf("%d %d", &N, &M);
	for (i = 0; i < M; i++) {
		scanf("%d %d", &u, &w);
		e[i*2].v = w;
		e[i*2+1].v = u;
		e[i*2].next = adj[u];
		e[i*2+1].next = adj[w];
		adj[u] = &(e[i*2]);
		adj[w] = &(e[i*2+1]);
		deg[u]++;
		deg[w]++;
	}
	
	int ans = 0, q[100001], head, tail;
	for (u = 1, tail = 0; u <= N; u++) if (deg[u] == 1) q[tail++] = u;
	for (head = 0; head < tail; head++) {
		u = q[head];
		if (deg[u] != 1) continue;
		ans ^= 1;
		for (p = adj[u]; p != NULL; p = p->next) {
			w = p->v;
			deg[w]--;
			if (deg[w] == 1) q[tail++] = w;
		}
	}
	return ans;
}

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