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

#define int long long

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t, n;
    cin >> t >> n;

    int l = 1, r = 1e12;
    int ans = 0;
    while (l <= r) {
        int mid = (l + r) / 2;
        int price = mid * (100 + t) / 100;
        int count = price - mid;
        // cout << mid << ' ' << count << endl;
        if (count >= n)
            ans = mid, r = mid - 1;
        else
            l = mid + 1;
    }
    int price = ans * (100 + t) / 100;
    int count = price - ans;
    cout << price - 1 - (count - n) << '\n';

    return 0;
}

#include "bits/stdc++.h"
#include <chrono>
#include <random>
#define lli long long int
using namespace std;
#define mod 1000000007
#define mod1 998244353
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); 
#define INF 1000000000
#define common cout << "Case #" << w+1 << ": "  
#define maxn 10010

void setIO(string name) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}

template< typename T> 
void PVecPrint(vector<T>&v) 
{ 
    for(int i=0;i<(int)v.size();i++) 
        cout << v[i].first << "," << v[i].second << ' '; 
    cout << '\n'; 
}
template<class T> 
void VecPrint(vector<T>&v)
{
    for(int i=0;i<v.size();i++) 
        cout << v[i] << ' ';
    cout << '\n';
}
/*-------------------------------------------------------------------Code-----------------------------------------------------------------*/

int main()
{
    int t,n;
    cin >> t >> n;
    set<int>s;
    int p=0,cnt=0,req;
    for(int i=1;i<1000;i++)
    {
        int r=(i*t)%100,q=(i*t)/100;
        if(s.find(r)!=s.end())
        {
            req=i-1;
            break;
        }
        s.insert(r);
        if(p!=q)
        {
            ++cnt;
            p=q;
        }
    }
    // cout << cnt << ' ' << req << '\n';
    if(cnt>=n)
    {
        // cout << "enter\n";
        int r=n,p=0;
        for(int i=1;i<1000;i++)
        {
            int q=(i*t)/100;
            if(p!=q)
            {
                if(r==1)
                {
                    cout << i+q-1 << '\n';
                    break;
                }
                --r;
                p=q;
            }
        }
    }
    else
    {
        int q=n/cnt,r=n%cnt;
        if(r==0)
        {
            q-=1;
            r=cnt;
        }
        lli ev=req*1LL*q;
        // cout << ev << ' ' << r  << '\n';
        lli prev=(ev*t)/100;
        for(lli i=ev+1;i<ev+1000;i++)
        {
            lli val=i+(i*t)/100,a=(i*t)/100;
            if(a!=prev)
            {
                if(r==1)
                {
                    cout << val-1 << '\n';
                    break;
                }
                // cout << val-1 << '\n';
                --r;
                prev=a;
            }
        }
    }
}