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

// template {{{
#define  range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)
#define rrange(i, l, r) for (i64 i = (i64)(r) - 1; i >= (i64)(l); (i) -= 1)

#define  whole(f, x, ...) ([&](decltype((x)) container) { return (f)(  begin(container),  end(container), ## __VA_ARGS__); })(x)
#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)

#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl

using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;

constexpr i32 mod   = 1e9 + 7;
// constexpr i32 mod   = 998244353;

constexpr i32 inf   = 1001001001;
constexpr i64 infll = 1001001001001001001ll;

constexpr i32 dx[] = {0, -1, 1, 0, -1, 1, -1, 1}; 
constexpr i32 dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};

struct IoSetup { IoSetup(i32 x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;

template <typename T = i64> T input() { T x; cin >> x; return x; }

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != (int)v.size() ? " " : ""); } return os; } 
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }

template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }

template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// }}}

void solve() {
  i64 n = input(), k = input();

  auto dp = make_vector(3, 4 * n, 0ll);
  range(a, 1, n + 1) dp[0][a] = 1;
  range(i, 0, 2) {
    range(a, 1, dp[i].size() - n - 1) {
      dp[i + 1][a + 1] += dp[i][a];
      dp[i + 1][a + n + 1] -= dp[i][a];
    }

    range(b, 1, dp[i].size()) dp[i + 1][b] += dp[i + 1][b - 1];
  }

  i64 s = 3;
  while (s < 3 * n) {
    // i64 p = (s - 1) * (s - 2) / 2;
    i64 p = dp[2][s];
    // debug(p);
    if (k <= p) break;
    k -= p;
    s++;
  }

  i64 a = 1;
  while (a < n) {
    i64 d = s - a;
    i64 l = d - n;
    i64 r = n;
    i64 p = max(r - l + 1, i64(0));
    p = dp[1][d];

    if (k <= p) break;
    k -= p;
    a++;
  }

  range(b, 1, s - a + 1) {
    int c = (s - a) - b;
    if (c > n) continue;
    k--;
    if (k) continue;

    cout << a << " " << b << " " << c << endl;
    return;
  }
}

signed main() {
  solve();
}

#include<bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define put(i) cout<<i<<endl
#define rep(i,s,n) for(long long i=s;i<(long long)(n);i++)
using namespace std;
using ll = long long;

int main(){
    ll a, b, c;
    cin >> a >> b >> c;

    if(a*a + b*b < c*c) put("Yes");
    else put("No");
}
