#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;

int main(){
	ios::sync_with_stdio(false);
	ll t,N; cin>>t>>N;

	ll ct=N/t;
	ll gen = 100*ct;
	// gen--;

	ct *=t;
	ll l=gen+1 + ((gen+1)*t)/100, r=gen+((gen*t)/100);
	cerr << ct << endl;
	cerr << gen << endl;
	// int k=5;
	while(1){
		if(ct==N){
			cout << r-1 << endl;
			return 0;
		}
		l=gen+1 + ((gen+1)*t)/100;
		r=gen+((gen*t)/100);
		// cerr << l <<" " << r << endl;
		if(l-r>=2){
			ct++;
			if(ct==N) break;
		}
		gen++;
	}
	cout << r+1 << endl;
	// for(int i=1; 1<=100; i++){
	// 	if()
	// }

	// ll en=1;
	// while((en+1)*t<100){
	// 	en++;
	// }
	// ll ret = en;
	// // cerr << en << endl;
	// en *= N;
	// while(N>0){
	// 	N /=100;
	// 	en += N*ret;
	// }
	// // cerr << en << endl;

	// // int k=5;
	// while(1){
	// 	// ll l=((100+t)*en/100;
	// 	// cerr << l << endl;
	// 	ll l=en+1 + ((en+1)*t)/100;
	// 	ll r=en+((en*t)/100);
	// 	cerr << en+1 + ((en+1)*t)/100  << " " <<  en+((en*t)/100) <<  endl;
	// 	if(l-r>=2){
	// 		break;
	// 	}
	// 	en++;
	// }
	// cout << en+((en*t)/100) + 1<< endl;

}

#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int main()
{
	ll t,n;
	cin>>t>>n;
	//take A = 100/t *n
	ll ans = 100*n;
	ans=(ans+t-1)/t;
	ans+=n-1;
	cout<<ans<<'\n';
}
