#include <bits/stdc++.h>
// #define x first
// #define y second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
const int N = 2e5 + 20;

int n, t;
bool vis[N];

int main()
{
	IOS; cin >> t >> n; 
	// LL l = 1, r = 1e13, res = 1;
	// while(l <= r)
	// {
		// LL mid = l + r >> 1;
		// if(t * mid >= n * 100ll)
		// {
			// r = mid - 1;
			// res = mid;
		// }
		// else l = mid + 1;
	// }
	// cout << res + n - 1 << endl;
	cout << (100ll * n + t - 1) / t + n - 1 << endl;
	return 0;
}
#include<bits/stdc++.h>
#define int long long
#define ls (rt<<1)
#define rs (rt<<1|1)
#define pii pair<int,int>
#define fi first
#define se second
#define rd(u) u=read()
#define endl '\n'
using namespace std;

const int N=2e6+5;
const int M=1e7+5;
const int mod=1e9+7;
const int inf=3e18;
inline int read(){int u=0,f=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){u=u*10+ch-'0';ch=getchar();}return u*f;}
int ksm(int u,int y=mod-2,int z=mod){int ret=1;while (y){if (y&1) ret=(ret*u);u=(u*u);y>>=1;}return ret;}
int t,n,m,ans;
int x[N],y[N];
signed main()
{
	rd(t);rd(n);
	for (int a=1;a<=100;a++) 
	{
		int b=(100+t)*a/100;
		x[b]=1;
	}
	for (int i=1;i<=100+t;i++) if (!x[i]) y[++m]=i;
	//for (int i=1;i<=m;i++) cout<<y[i]<<" ";cout<<endl;
	n--;
	ans=(n/m)*(100+t);
	ans+=y[(n%m+1)];
	cout<<ans<<endl;
}