#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define _GLIBCXX_DEBUG
ll gcd(ll x,ll y){
  if(x<y)swap(x,y);
  if(y==0)return x;
  return gcd(y,x%y);
}
ll lcm(ll a,ll b){
  return a*b/gcd(a,b);
}


int main() {

  ll t,N;
  cin>>t>>N;
  int Q[200]={0};
  for(int i=1;i<101;i++){
    for(int j=1;j<=100+t;j++){
      if(i+(t*i)/100==j){
        Q[j]=1;
      }
    }
  
  }

  ll count=0;
  ll R[200];
  for(int i=1;i<=100+t;i++){
   
    if(Q[i]==0){
    count++;
    
    R[count]=i;
 
    }
    
  }
  
  ll L=0;
  if(N%count==0)L=N/count-1;
  else L=N/count;
  ll M=N%count;
  ll ans=0;
  if(M==0){
  ans=L*(100+t)+R[count];
  }
  else{
  ans=L*(100+t)+R[M];
  }
  cout<<ans<<endl;

}
#include<cstdio>
#define ll long long
ll t, n, ans;
int main(){
	scanf("%lld%lld", &t, &n);
	ans = 100*n/t;
	if(100*n % t != 0) ans++;
	ans = ans + ans*t/100;
	printf("%lld", ans-1);
	return 0;
}