#include <iostream>
#include <cmath>
#include <vector>
#include <cstdio>
#include <iomanip>
#include <algorithm>
#include <chrono>

using namespace std;

int main() {
  long long int t,n;
  cin>>t>>n;

  vector<long long int> skip;
  long long int pre = 1;
  for(long long int base=1;base<=100;base++){
    if(floor(base*(100+t)/100)-pre>1) skip.push_back(pre+1);
    pre=floor(base*(100+t)/100);
  }
  //for(int i=0;i<(int)skip.size();i++){
  //  cout<<skip[i]<<" ";
  //}

  long long int period = 100+t;
  long long int nSet = n/t;
  //cout<<endl<<nSet<<"*"<<period<<endl;
  //cout<<"n%t = "<<n%t<<endl;
  long long int answer = 0;
  if(n%t==0){
    answer = period*nSet-1;
  }else{
    answer = period*nSet+(skip[n%t-1]);
  }
  cout<<answer<<endl;
  return 0;
}

#include <bits/stdc++.h>
using namespace std;

#define forn(i,n) for(int i=0;i<(int)(n);i++)
#define si(c) ((int)(c).size())
#define forsn(i,s,n) for(int i = (int)(s); i<((int)n); i++)
#define dforsn(i,s,n) for(int i = (int)(n)-1; i>=((int)s); i--)
#define all(c) (c).begin(), (c).end()
#define D(a) cerr << #a << "=" << a << endl;
#define pb push_back
#define eb emplace_back
#define mp make_pair

typedef long long int ll;
typedef vector<int> vi;
typedef pair<int,int> pii;


int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);

    int t,n; cin >> t >> n;

    ll lo = 0, hi = 1e15;
    while (lo + 1 < hi) {
        ll mi = (lo+hi)/2;
        ll should = mi, reach = (mi * (100+t) / 100);
        if (reach - should >= n) hi = mi;
        else lo = mi;
    }
    cout << hi+n-1 << endl;

    return 0;
}
