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

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

	long long a = 0;
	long long b = 0;
	vector<int> v;
	while( a < 1000 ) {
		a++;
		long long c = (100 + t) * a / 100;
		if( c - b > 1 ) {
			v.push_back( a );
			if( a == 100 ) break;
		}
		b = c;
	}
	int n = v.size();
	a = N / n * 100;
	int m = N % n;
	if( m == 0 ) {
		a -= 100;
		m = n;
	}
	long long ans;
	b = (100 + t) * a / 100;
	while( 1 ) {
		a++;
		long long c = (100 + t) * a / 100;
		if( c - b > 1 ) {
			ans = b + 1;
			m--;
			if( m == 0 ) break;
		}
		b = c;
	}

	cout << ans << endl;
}

#include <bits/stdc++.h>
#include <unordered_set>

#define f(i, a, b) for (int i = a; i < b; i++)
#define rf(i, a, b) for (int i = a; i > b; i--)
#define lf(i, a, b) for (long long i = a; i < b; i++)
#define sq(a) (a)*(a)
#define cube(a) (a)*(a)*(a)
#define pb push_back
#define ppb pop_back
#define LB lower_bound
#define UB upper_bound
#define sarr(arr, n) sort(arr, arr + n);
#define svec(v) sort(v.begin(), v.end());
#define svecr(v) sort(v.rbegin(), v.rend());
#define intinp(var) int var; \
        cin >> var;
#define adjc(adj, n) int adj[n];
#define adjcw(adj, n) vector<pair<int, int>> adj[n];
#define PYES cout << "YES\n"
#define PNO cout << "NO\n"
#define PYes cout << "Yes\n"
#define PNo cout << "No\n"
#define endl "\n"

using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vii;
typedef vector<string> vs;
typedef unordered_map<int, int> um;

int main(){
    ll t, n; cin >> t >> n;
    ll mn = (100*n)/t;
    if ((100*n)%t) mn++;
    cout << mn + n-1 << endl;
    return 0;
}
