#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define rrep(i, n) for (int i = (int)n-1; i >= 0; --i)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;

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; }

__attribute__ ((constructor))
void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
}

int main(){
    int x, y;
    cin >> x >> y;
    if(min(x,y) + 3 > max(x,y)){
        cout << "Yes" << endl;
    }else{
        cout << "No" << endl;
    }
    return 0;
}
#include <bits/stdc++.h>
#define rep(a,n) for (int a = 0; a < (n); ++a)
using namespace std;
using ll = long long;

ll t,n;

ll f(ll A){
	return (100+t)*A/100;
}

bool check(ll x){
	if(f(x)-x<=n)return true;
	else return false;
}

ll BinarySearch(){
	ll ok = 0;
	ll ng = 1e16;
	while(abs(ok-ng)>1){
		ll mid = (ok+ng)/2;
		if(check(mid))ok=mid;
		else ng=mid;
	}
	return ok;
}

int main(){
	cin >> t >> n;
	n--;
	cout << f(BinarySearch()) + 1 << endl;
	return 0;
}