//#pragma GCC optimize("Ofast") //#pragma GCC optimize("unroll-loops") #include using namespace std; using ll = long long; using ull = unsigned long long; using lll = __int128_t; using ld = long double; using pll = pair; using vi = vector; using vd = vector; using vp = vector; using vS = vector; using vvi = vector; using vvd = vector; using vvp = vector; using v3i = vector; using v3d = vector; using v3p = vector; using v4i = vector; using v5i = vector; using v6i = vector; #if __has_include() #include using namespace atcoder; using mint = modint998244353; using Mint = modint1000000007; using vm = vector; using vM = vector; using vvm = vector; using vvM = vector; using v3m = vector; using v3M = vector; using v4m = vector; using v5m = vector; #endif template using r_pQ = priority_queue, greater>; #define rrep(i, n) for (ll i = (n)-1; (i) >= 0; --(i)) #define rep(i, n) for (ll i = 0; (i) < (n); ++(i)) #define loop(i, a) for(ll i = a; true; ++(i)) #define reps(i, n) for (ll i = 1; (i) <= (n); ++(i)) #define Rep(i,a,b) for(ll i = (a); i <= (b); i++) #define all(a) (a).begin(),(a).end() const ll MOD = 998244353; const ll Hash = 10000000000000061; #define Yes(b) ((b)?cout << "Yes" << endl:cout << "No" << endl) #define YES(b) ((b)?cout << "YES" << endl:cout << "NO" << endl) #define Aoki(b) ((b)?cout << "Aoki" << endl:cout << "Takahashi" << endl) #define flush cout << endl; #define out(x) cout << (x) << endl #define vout(v) for(auto x : (v)) cout << x << ' '; #define vin(v) rep(i, (v).size()) cin >> (v)[i] #define vin_(v); rep(i, (v).size()) {cin >> (v)[i]; (v)[i]--;} #define vvin(v, w) rep(i, (v).size()) { rep(k, (w)) { cin >> (v)[i][k]; } } #define ft first #define sd second #define vInP(v) rep(i, (v).size()) cin >> (v)[i].ft >> (v)[i].sd #define vInP_(v) rep(i, (v).size()) {cin >> (v)[i].ft >> (v)[i].sd; (v)[i].ft--; (v)[i].sd--;} bool chmin(ll& a, ll b) { return a > b ? a = b, 1 : 0; } bool chmax(ll& a, ll b) { return a < b ? a = b, 1 : 0; } vi s90 = { 0, 1, 0, -1 }, c90 = { 1, 0, -1, 0 }; vi s45 = { 0, 1, 1, 1, 0, -1, -1, -1 }, c45 = { 1, 1, 0, -1, -1, -1, 0, 1 }; void solve(); signed main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); int t = 1; // cin >> t; rep(i, t) solve(); } void solve(){ ll A, B; cin >> A >> B; if(A <= B) cout << "Yes" << endl; else cout << "No" << endl; }