/*#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <iomanip>//fixed,setprecision
#include <limits.n>//INT_MAX
#include <math.n>//M_PI
#include <random>
#include <regex> // 正規表現
#include <time.h>*/
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
//using mint = modint1000000007;
using mint = modint998244353;
//std::chrono::time_point<std::chrono::steady_clock> start;
template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }
template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef pair<int, int> P;
using vi=vector<int>;
using vvi=vector<vi>;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll a, ll b){return a * b / gcd(a, b);}
template<class T, class U>
//contain(string s,string v) sにvが含まれるかを判定

bool contain(const std::basic_string<T>& s, const U& v) {
   return s.find(v) != std::basic_string<T>::npos;
}

// トポロジカルソートする
struct toposo {
    
	vector<vector<int>> E; toposo(int n) { E.resize(n); }
    
	void add_edge(int a, int b) { E[a].push_back(b); }
    
	bool visit(int v, vector<int>& order, vector<int>& seen) {
		seen[v] = 1;
        for (int u : E[v]) {
			if (seen[u] == 2) continue;
			if (seen[u] == 1) return false;
	        if (!visit(u, order, seen)) return false;
		}
		order.push_back(v);
		seen[v] = 2;
		return true;
	}
    // トポロジカルソート順
	bool sort(vector<int> &order) {
		int n = E.size();
		vector<int> seen(n);
        rep(u,n)if (!seen[u] && !visit(u, order, seen)) return false;
        reverse(order.begin(), order.end());
		return true;
	}
};

int main(){
	int n,s;
	cin>>n>>s;
	int hantei=s-n+1;
	int hantei2=(s+n-1)/n;
	if(hantei>=25&&hantei<30)cout<<"Yes"<<endl;
	else if(hantei2>=25&&hantei2<30)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	return 0;
}