#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

ll pre[4000100], *p = pre + 1000010;

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


	ll N, K;
	cin >> N >> K;

	ll kei = 0;
	rep(i, N) p[i] = i + 1;
	rep(i, N) p[2 * N - i - 2] = i + 1;
	rep(i, 3 * N + 10) p[i + 1] += p[i];

	ll tmpkei = 0;
	rep(i, 3 * N - 2) {
		tmpkei += p[i] - p[i - N];

		if (tmpkei >= K) {
			tmpkei -= p[i] - p[i - N];
			ll k = K - tmpkei;
			ll ima = 0;
			rep(j, min((int)N - 1, i) + 1) {
				ima += p[i - j] - p[i - j - 1];
				if (ima >= k) {
					ima -= p[i - j] - p[i - j - 1];
					co(j + 1);
					rep(a, N) {
						ll b = i - j - a;
						if (b >= 0 && b < N) {
							ima++;
							if (ima >= k) {
								co(a + 1);
								co(b + 1);
								return 0;
							}
						}
					}
				}
			}
		}
	}





	Would you please return 0;
}
#include<bits/stdc++.h>
using namespace std;
int t,n;
int main(){
        cin>>t>>n;
        cout<<(100*1ll*n+t-1)/t*(100+t)/100-1<<endl;
        return 0;
}