#include <algorithm> #include <bitset> #include <cassert> #include <cmath> #include <cstdio> #include <fstream> #include <functional> #include <iomanip> #include <iostream> #include <iterator> #include <map> #include <numeric> #include <queue> #include <set> #include <sstream> #include <stack> #include <unordered_set> using namespace std; #if __has_include(<atcoder/all>) #include <atcoder/all> using namespace atcoder; #endif #define GET_MACRO(_1, _2, _3, NAME, ...) NAME #define _rep(i, n) _rep2(i, 0, n) #define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++) #define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() using i64 = long long; template<class T, class U> bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; } template<class T, class U> bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; } template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;} template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);} template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;} template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;} template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;} int main(){ int n, m; cin >> n >> m; vector edge(n, vector<int>()); vector<int> cnt(n, 0); map<pair<int, int>, int> mp; rep(i, m){ int a, b; cin >> a >> b; a--, b--; cnt[a]++; cnt[b]++; edge[a].emplace_back(b); edge[b].emplace_back(a); mp[{min(a, b), max(a, b)}]++; } queue<int> que; int c = 0; rep(i, n) if (cnt[i] == 1) que.emplace(i); while (!que.empty()){ auto now = que.front(); que.pop(); for (auto e: edge[now]){ if (mp[{min(e, now), max(e, now)}]){ c++; mp[{min(e, now), max(e, now)}] = 0; cnt[e]--; if (cnt[e] == 1){ que.emplace(e); } } } } cout << (c & 1? "Yes": "No") << endl; }