#include <iostream>
#include <cmath>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <iterator>
#include <unordered_map>
#include <unordered_set>
#include <sstream>
#include <fstream>
#include <numeric>
#include <tuple>
#include <ctime>
#include <random>
#include <array>
#include <cassert>

using namespace std;

#define fori(t) for(int i = 0; i < t; ++i)
#define forj(n) for(int j = 0; j < n; ++j)
#define fork(n) for(int k = 0; k < n; ++k)
#define forai(a) for(auto& i : a)
#define foraj(a) for(auto& j : a)
#define forak(a) for(auto& k : a)
#define forp(s, n, d) for(int p = s; p < n; p += d)
#define fast ios_base::sync_with_stdio(0); cin.tie(0);
#define pb(a) push_back(a);
#define pob(a) pop_back(a);
#define sorti(a) sort((a).begin(), (a).end());
#define sortm(a, n) sort(a, a + n);
#define reversi(a) reverse((a).begin(), (a).end());
#define all(a) (a).begin(), (a).end()
#define fi first
#define se second
#define yes cout << "YES\n";
#define no cout << "NO\n";
#define ans(a) cout << a << '\n';
#define endl '\n'
#define res(a, n) (a).resize(n);
#define read(a, n) (a).resize(n); fori(n) cin >> a[i];
#define print(a) for (auto hart : a) cout << hart << ' ';
#define clear(a) (a).clear();
//#define int long long
//#define double long double

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<long long, long long> llll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vii;
typedef vector<pair<int, pair<int, int>>> viii;
typedef pair<int, pair<int, int>> iii;
typedef vector<pair<long long, long long>> vllll;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
typedef pair<char, char> cc;
typedef pair<pair<char, char>, char> ccc;
typedef vector<char> vc;
typedef pair<int, char> ic;
typedef pair<ii, char> iic;
typedef vector<bool> vb;
typedef set<int> si;
typedef vector<vector<ii>> vvii;
typedef vector<vector<iii>> vviii;
typedef vector<vector<llll>> vvllll;

const int INF = 2147483647;
const ll LONGINF = 9223372036854775807;
const ll MOD = 1e9 + 7;

void solve()
{
    ll t, n;
    cin >> t >> n;
    ll l = 1, r = 1e12;
    while (l < r)
    {
        ll m = (l + r) >> 1ll;
        if (floorl((ld)(m * t) / 100.0) < n) l = m + 1;
        else r = m;
    }
    ans(l + n - 1)
}

signed main()
{
    fast
    bool mult = false;
    if (mult)
    {
        int t;
        cin >> t;
        while (t--) solve();
    }
    else solve();
    return 0;
}

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

int main() {
  ll t, N;
  cin >> t >> N;
  set<ll> hundred;
  vector<ll> hundred2;
  // for (int i = 1; i <= 1000000; i++) {
  //   hundred.insert(((100 + t) * i) / 100);
  // }
  // for (int i = 1; i <= 1000000; i++) {
  //   if (!(hundred.count(i))) {
  //     hundred2.push_back(i);
  //   }
  // }
  ll count = t;
  ll start = (N / count) * 100;
  ll nokori = N % count;
  // for (ll x : hundred2) {
  //   cout << x << endl;
  // }
  // cout << ((100 + t) * (start + hundred2.at(nokori))) / 100 << endl;
  // cout << start + hundred2.at(nokori) << endl;
  // cout << (((100 + t) * start)) - 1 / 100 << endl;
  set<ll> ans;
  vector<ll> ans2 = {0};
  for (ll i = start; i <= start + 1000000; i++) {
    ans.insert(((100 + t) * i) / 100);
  }
  for (ll i = ((100 + t) * start) / 100;
       i <= (((100 + t) * start) / 100) + 1000000; i++) {
    if (!(ans.count(i))) {
      ans2.push_back(i);
    }
  }
  // for (ll x : ans2) {
  //   cout << x << endl;
  // }
  // cout << nokori << endl;
  if (nokori != 0) {
    cout << ans2.at(nokori) << endl;
  } else {
    cout << (((100 + t) * start) / 100) - 1 << endl;
  }
  return 0;
}