#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr ll mod=1e9+7;

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  ll t, n;
  cin>>t>>n;
  auto f = [&](auto x){
    return (ll)floor((100+t)*x*0.01);
  };
  ll ok = 0, ng = 100*n;
  while (abs(ok-ng) > 1) {
    ll mid = (ok + ng) / 2;
    if (f(mid) - mid < n) {
      ok = mid;
    } else {
      ng = mid;
    }
  }
  cout << f(ok) + 1 << "\n";
}
#include<bits/stdc++.h>
using namespace std;

int t,N,hah[160];

vector<int> g;

template<typename Tp>
void read(Tp &x)
{
	x=0;int f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}x*=f;
}

int main()
{
	read(t),read(N);
	for(int i=1;i<=100;i++)
	{
		int now=(100+t)*i/100;
		hah[now]=1;
	}
	for(int i=1;i<=100+t;i++) if(!hah[i]) g.push_back(i);
	int sz=g.size();
	int d=N/sz;
	if(N%sz==0) d--;
	N%=sz;
	if(!N) N=sz;
	N--;
	printf("%lld\n",(long long)(100+t)*d+g[N]);
	return 0;
}
