/*@author Vipen Loka*/
#include <bits/stdc++.h>
#define endl '\n'
#define ff first
#define ss second
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define deb(x) cout << #x << ':' << x << '\n';
#define int long long
using namespace std;
template<class T>void show(vector<T> &a) {cerr << "[ "; for (int ij = 0; ij < (int)a.size(); ij++) {cerr << a[ij] << " ";} cerr << "]\n";}
template<class T>void show(T a) {cerr << a << endl;}

int n, k;
int nc2(int n) {
	if (n <= 0) {
		return 0;
	}
	return (n * (n - 1)) / 2;
}
int f(int s) {
	int res = nc2(s - 1);
	res -= nc2(s - 1 - n) * 3;
	res += nc2(s - 1 - n * 2) * 3;
	res -= nc2(s - 1 - n * 3) * 3;
	return res;
}
int f2(int s) {
	int l = max(1LL, s - n);
	int r = min (n, s - 1);
	if (l > r)return 0;
	return r - l + 1;
}
void solve() {
	int i, j;

	cin >> n >> k;
	int ksum, pref = 0;
	for (int sum = 3; sum <= 3 * n; sum++) {
		int now = f(sum);
		if (k <= now) {
			ksum = sum;
			break;
		}
		else {
			k -= now;
		}
	}

	pref = 0;
	int beauty, taste, popularity;

	for (beauty = 1; beauty <= n; beauty++) {
		int now = f2(ksum - beauty);
		if (k <= now) {
			break;
		}
		else {
			k -= now;
		}
	}

	for (taste = 1; taste <= n; taste++) {
		popularity = ksum - beauty - taste;
		if (popularity <= 0 || popularity > n)continue;
		if (k == 1) {
			break;
		}
		k--;
	}
	popularity = ksum - beauty - taste;

	cout << beauty << ' ' << taste << ' ' << popularity << endl;

}


int32_t main(int32_t argc, char *argv[]) {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int T = 1;
	// cin >> T;
	while (T--) {
		solve();
	}
	cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
}
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 10007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 1;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

const int sup = 1000000;
ll dp[3 * sup + 5][4];
void solve() {
	int n; ll k; cin >> n >> k;
	dp[0][0] = 1;
	rep(t, 3) {
		rep(i, t * n + 1) {
			dp[i + 1][t + 1] += dp[i][t];
			dp[i + n + 1][t + 1] -= dp[i][t];
		}
		rep(i, (t + 1)* n + 1) {
			dp[i + 1][t + 1] += dp[i][t+1];
		}
	}
	k--;
	ll s = 0;
	for (int i = 3; i <= 3 * n; i++) {
		if (k < dp[i][3]) {
			s = i; break;
		}
		else {
			k -= dp[i][3];
		}
	}
	ll ans[3] = {};
	//cout << dp[4][2] << "\n";
	rep1(c, n) {
		ll r = s - c;
		if (k < dp[r][2]) {
			ans[0] = c; break;
		}
		else {
			k -= dp[r][2];
		}
	}
	s -= ans[0];
	rep1(c, n) {
		ll r = s - c;
		if (k < dp[r][1]) {
			ans[1] = c; break;
		}
		else {
			k -= dp[r][1];
		}
	}
	s -= ans[1];
	ans[2] = s;
	rep(i, 3) {
		if (i > 0)cout << " ";
		cout << ans[i];
	}
	cout << "\n";
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//int t; cin >> t;rep(i,t)
	//while(cin>>n,n)
	//solve();
	solve();
	return 0;
}