#include using namespace std; int main() { int n, m; cin >> n >> m; vector> graph(n); vector degree(n); for (int i = 0; i < m;i++) { int a, b; cin >> a >> b; a--; b--; graph[a].push_back(b); graph[b].push_back(a); degree[a]++; degree[b]++; } queue que; for (int i = 0; i < n;i++) { if(degree[i] == 1) { que.push(i); } } vector sel(n); int cnt = 0; while(!que.empty()) { int now = que.front(); que.pop(); if(degree[now] == 0) { continue; } cnt++; degree[now] = 0; for(int adj: graph[now]) { if(sel[adj]) { continue; } degree[adj]--; if(degree[adj] == 1) { sel[adj] = true; que.push(adj); } } } if(cnt % 2 == 1) { cout << "Yes" << endl; } else { cout << "No" << endl; } return 0; }