#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
const int INF = 1 << 29;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int& n, int b) { n |= two(b); }
inline void unset_bit(int& n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
  int res = 0;
  while (n && ++res) n -= n & (-n);
  return res;
}
template <class T>
void chmax(T& a, const T& b) {
  a = max(a, b);
}
template <class T>
void chmin(T& a, const T& b) {
  a = min(a, b);
}
const int MAX = 51;
long long N, M;
int main() {
  cin >> N >> M;
  --M;
  int result[MAX], be = 0, en = N - 1;
  for (int i = (1); i <= (N); i++) {
    long long n = 1LL << (long long)(N - 1 - i);
    if (n <= M) {
      result[en--] = i;
      M -= n;
    } else
      result[be++] = i;
  }
  for (int i = 0; i < (N); i++) cout << result[i] << " ";
  cout << endl;
  return 0;
}
