#define _CRT_SECURE_NO_WARNINGS

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <math.h>

#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(a) ((a) < 0 ? (-(a)) : (a))

typedef long long ll;

using namespace std;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL);

	ll t;
	ll N;

	scanf("%lld %lld", &t, &N);

	ll q;

	if ((100LL * N) % t == 0) q = (100LL * N) / t - 1;
	else q = (100LL * N) / t;

	printf("%lld\n", q + (t * q / 100) + 1);

	return 0;
}
#include <bits/stdc++.h>

#define int long long

using namespace std;

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t, n;
    cin >> t >> n;
    bool vis[100005];
    for (int i = 0; i < 100005; i++) vis[i] = false;
    for (int i = 0; i <= 100000; i++) {
        int x = ((100+t)*i)/100;
        if (x < 100005) vis[x] = true;
    }
    vector<int> cyc;
    for (int i = 0; i < 100005; i++) if (!vis[i]) {
            if (cyc.size() < 100*t) {
                cyc.push_back(i);
            }
        }
    n--;
    int res = (cyc[100*t-1]+1)*(n/(100*t));
    n %= 100*t;
    res += cyc[n];
    cout << res << '\n';

}