#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n, fi;
  cin >> n >> fi;
  vector<ll> ans;
  auto dfs = [&](auto self, ll acc, ll i) -> bool {
    if (i <= 0) {
      return false;
    }
    ll pre = n + 10;
    if (!ans.empty()) {
      pre = ans.back();
    }
    if (i == 1) {
      if (n - acc < pre) {
        ans.push_back(n - acc);
        return true;
      } else {
        return false;
      }
    }
    ll now = 1;
    for (ll x = i; x < pre; x++) {
      if (acc + now > n) {
        break;
      }
      ans.push_back(x);
      if (acc + now == n) {
        return true;
      } else if (self(self, acc + now, i - 1)) {
        return true;
      }
      ans.pop_back();
      now *= x + 1;
      now /= x + 1 - i;
    }
    return false;
  };
  if (fi == 1 || fi == n - 1) {
    ans.push_back(n);
  } else if (fi >= n) {
    rep(k, n) ans.push_back(fi - k);
  } else {
    dfs(dfs, 0, fi);
  }
  rep(i, ans.size()) cout << (i ? " " : "") << ans[i];
  cout << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}