#include <bits/stdc++.h>
//#include <atcoder/all>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

const long long INF = 1e18;
//const ll mod = 1000000007;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll t, N;
    cin >> t >> N;
    ll A = (100 * N + t - 1) / (t);
    cerr << A << endl;
    ll ans = (100 + t) * A / 100 - 1;
    cout << ans << endl;
    return 0;
}

#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define debug(output) if(debugFlag)cout<<#output<<"= "<<output<<endl
using lint = long long;
typedef pair<int,int> P;
const bool debugFlag=true;
const lint linf=1e18+7;
const lint inf=1e9+7;
const int MOD=1000000007;
lint gcd(lint a,lint b){
  if(b==0)return a;
  return gcd(b,a%b);
}
signed main(){
  int t;cin>>t;
  lint n;cin>>n;
  lint res=0;
  lint b=100;
  res=n/t*b;
  n%=t;
  lint ans=res*(100+t)/b;
  rep1(x,100){
    if(n==0)break;
    if((res+x)*(100+t)/b>=(res+x-1)*(100+t)/b+2){
      --n;ans=(res+x)*(100+t)/b;
    }
  }
  cout<<ans-1<<"\n";
  return 0;
}