#include <iostream>
#include <string>
using namespace std;

int main(){
  long long t, n, max, flag = 0, i, ans;
  cin >> t >> n;
  max = 100 * n / t + 1;
  i = max;

  while (flag == 0){
    if ((100 + t) * i / 100 - ((100 + t) * (i - 1) / 100) == 2){
      ans = (100 + t) * i / 100 - 1;
      flag = 1;
    }
    i--;
  }
  cout << ans << endl;
  return 0;

}

using namespace std;
#include <bits/stdc++.h>
#define ll long long
ll t,n;
int main(){
	scanf("%lld%lld",&t,&n);
	ll c=0;
	for (int i=1;i<=100;++i)
		c+=max((t+100)*i/100-(t+100)*(i-1)/100-1,0ll);
	ll d=(n-1)/c;
	n-=d*c;
	for (ll i=d*100+1;i;++i){
		ll tmp=max((t+100)*i/100-(t+100)*(i-1)/100-1,0ll);;
//		printf("%lld %lld\n",i,tmp);
		if (n>tmp)
			n-=tmp;
		else{
			printf("%lld\n",(ll)((t/100.0+1)*(i-1))+n);
			return 0;
		}
	}
	return 0;
}