// Problem: A - Tax Included Price
// Contest: AtCoder - AtCoder Regular Contest 118
// URL: https://atcoder.jp/contests/arc118/tasks/arc118_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Author: abhidot

#include <bits/stdc++.h>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mod 1000000007 //998244353
#define lld long double
#define pii pair<int, int>
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rep(i,x,y) for(int i=x; i<y; i++)
#define fill(a,b) memset(a, b, sizeof(a))
#define vi vector<int>
#define setbits(x) __builtin_popcountll(x)
#define w(x)  int x; cin>>x; while(x--)
using namespace std;
const long long N=200005, INF=2000000000000000000;

/*------------- Modular exponentiation -------------*/
int power(int a, int b, int p)
    {
        if(a==0)
        return 0;
        int res=1;
        a%=p;
        while(b>0)
        {
            if(b&1)
            res=(res*a)%p;
            b>>=1;
            a=(a*a)%p;
        }
        return res;
    }
	

/*------------- Sieve --------------*/	
vector <int> prime;
bool is_composite[N];

void sieve (int n) {
	fill (is_composite, false);
	for (int i = 2; i < n; ++i) {
		if (!is_composite[i]) prime.push_back (i);
		for (int j = 0; j < prime.size () && i * prime[j] < n; ++j) {
			is_composite[i * prime[j]] = true;
			if (i % prime[j] == 0) break;
		}
	}
}


/*------------ Utitlity function ---------------*/
void print(bool n){
    if(n){
        cout<<"YES";
    }else{
        cout<<"NO";
    }
}


int32_t main()
{
    IOS;
    int t,n;
    cin>>t>>n;
    n--;
    set<int> s;
    for(int i=1;i<=100+t;i++){
    	s.insert(i);
    }
    for(int i=1;i<=100;i++){
    	int val = (100+t)*i/100;
    	if(s.find(val)!=s.end()) s.erase(val);
    }
    // cout<<s.size()<<"\n";
    int q = n/s.size();
    n%=s.size();
    int r=0;
    for(auto i:s){
    	// cout<<i<<" ";
    	if(n<0) break;
    	if(n==0){
    		r = i;
    		break;
    	}else{
    		n--;
    	}
    }
    cout<<(100+t)*q + r<<"\n";
}

// Written by abhidot
#include<iostream>
#include<vector>
using namespace std;


long long T, N;

void read() {
    cin >> T >> N;
}


void work() {
    vector<pair<int, int> > t;
    for (int i = 0; i < 100; ++i) {
        int a = i * (100 + T) / 100;
        int b = (i + 1) * (100 + T) / 100;

        if (a + 1 < b) {
            t.push_back(make_pair(i, a));
        }
    }

    long long v = 100 * ((N - 1) / T) + t[(N - 1) % T].first + 1;
    cout << v * (100 + T) / 100 - 1 << endl;
}


int main() {
    read();
    work();
    return 0;
}
