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

int main(){
  long long t, N;
  cin >> t >> N;
  long long n = 100 * N / t;
  if(100 * N % t != 0) n++;
  n += (N - 1);
  cout << n << endl;
}
#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(NULL)
#define sc(z) scanf("%d", &(z))
#define _ff(i, a, b) for (ll i = a; i <= b; ++i)
#define _rr(i, a, b) for (ll i = b; i >= a; --i)
#define _f(i, a, b) for (ll i = a; i < b; ++i)
#define _r(i, a, b) for (ll i = b - 1; i >= a; --i)
#define mkp make_pair
#define endl "\n"
using namespace std;
typedef long long ll;
typedef long double ld;

const int N = 1e5 + 5;
int a[N];

int main() {
    ll t, n; cin >> t >> n;
    for (int i = 1; i <= 100; ++i) {
        a[(100+t) * i / 100] = 1;
    }
    vector<int> v;
    for (int i = 1; i <= 100 + t; ++i) {
        if (!a[i]) v.push_back(i);
    }
    // for (int i : v) cout << i << " ";
    ll ans;
    if (n % v.size()) {
        ans = (100 + t) * (n / v.size()) + v[n % v.size() - 1];
    } else {
        ans = (100 + t) * (n / v.size() - 1) + v[v.size() - 1];
    }
    cout << ans << endl;
    return 0;
}