#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
// using mint = modint998244353;
typedef long long ll;
#define int long long
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define nrep(i,n) for (int i = 1; i <= (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
#define bit(n,k) ((n>>k)&1) /*nのk bit目*/
#define bit_count(x) __builtin_popcountll(x)
#define debug(x) cout << #x << ": " << x << endl;
using P = pair<int,int>;
#define INF 1001001001
#define LINF (1LL<<60)
template<class T> inline bool chmax(T& a, T b){ if(a<b){ a=b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b){ if(a>b){ a=b; return 1; } return 0; }

int32_t main() {
  int n, s; cin >> n >> s;
  if(25*n <= s && s <= 29*n) puts("Yes");
  else puts("No");
}