//ABC 200 E - Patisserie ABC 2
//https://atcoder.jp/contests/abc200/tasks/abc200_e

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



int main() {
	int n;
	long long k;
	cin >> n >> k;
	//已选了几个数，其数字和是多少
	
	long long dp[4][3000005] = {};

	dp[0][0] = 1;
	for(int i = 0; i < 3; i++) {    // 推送给、贡献给父问题
		for(int j = 0; j <= i * n; j++) {
			dp[i + 1][j + 1] += dp[i][j];      //区间统一修：差分
			dp[i + 1][j + n + 1] -= dp[i][j];
		}
		for(int j = 1; j <= (i + 1) * n; j++) //差分+前缀和
			dp[i + 1][j] += dp[i + 1][j - 1];    //才是最后的值
	}

	int x;
	for(int i = 3; i <= 3 * n; i++)
		if(k <= dp[3][i]) {
			x = i;
			break;
		} else k -= dp[3][i];   //为何要减去？

	for(int i = 1; i <= n; i++) {
		int jmi = max(1, x - i - n);
		int jma = min(n, x - i - 1);
		if(jmi > jma) continue;
		if(k > (jma - jmi + 1)) {
			k -= (jma - jmi + 1);
			continue;
		}
		int y = jmi + k - 1;
		int z = x - i - y;
		cout << i << ' ' << y << ' ' << z << '\n';
		return 0;
	}
}
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;

template<class T>
bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template<class T>
bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }

using ll = long long;
using P = pair<int, int>;
using vvi = vector<vector<int>>;
using vi = vector<int>;

const ll MOD = 1e9 + 7;
const int INF = 1001001001;
const double PI = 3.14159265358979323846;


void solve() {
    ll t, n;
    cin >> t >> n;

    ll ng = 0;
    ll ok = 1e13;
    while (ok - ng > 1) {
        ll mid = (ng+ok)/2;
        ll now = mid*t/100;
        if (now >= n) {
            ok = mid;
        } else {
            ng = mid;
        }
    }
    ll a = ok + ok*t/100;
    ok--;
    ll b = ok + ok*t/100;
    ll ans = (a+b)/2;
    cout << ans << endl;
}

int main() {

    solve();

    return 0;
}
