#include<bits/stdc++.h>
using namespace std;
int main()
{
   long long int t,N,ans;
    cin >> t >> N;
   ans = ceil(N * 100 + t - 1) / t + N - 1;
   cout << ans << endl;
}



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

using namespace std;

void solve(int test, istream &in) {
    int64_t t, n;
    in >> t >> n;
    n--;
    vector<int64_t> p(101);
    for (int i = 0; i < 101; i++) {
        p[i] = i * (100 + t) / 100;
    }
    int64_t cnt100 = p[100] - p[0] - 100;
    int64_t x0 = (n / cnt100) * (100 + t);
    int64_t x = x0;
    n = n % cnt100;
    for (int i = 0; i < 100; i++) {
        int64_t cnt = p[i + 1] - p[i] - 1;
        x = x0 + p[i] + 1;
        if (n >= cnt) {
            n -= cnt;
        }
        else
            break;
    }
    x += n;
    printf("%lld\n", x);
}

int main(int argc, char* argv[])
{
#ifdef VLAD_LOCAL
	//FILE *f = fopen("in.txt", "r");
    ifstream f("in.txt");
    auto start = std::chrono::steady_clock::now();
#else
	//FILE *f = stdin;
    istream &f = cin;
#endif
    int tests = 1;
    //f >> tests;
    for (int test = 0; test < tests; test++) {
        solve(test, f);
    }
#ifdef VLAD_LOCAL
    auto end = std::chrono::steady_clock::now();
    double seconds = (double)std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count() / 1000;
    printf("\n%.3lf seconds\n", seconds);
#endif
	return 0;
}

