#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
inline T bigmod(T p, T e, T M) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigmod(p, e / 2, M);
    return (T)((t * t) % M);
  }
  return (T)((long long int)bigmod(p, e - 1, M) * (long long int)p) % M;
}
template <class T>
inline T bigexp(T p, T e) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigexp(p, e / 2);
    return (T)((t * t));
  }
  return (T)((long long int)bigexp(p, e - 1) * (long long int)p);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int dx4[] = {1, 0, -1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
int month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int a[15], val[50000], ar[50000][15];
int main() {
  for (__typeof(8) i = (1); i <= (8); i++) a[i] = i;
  int n, m, c = 0, mx = 0;
  scanf("%d %d", &n, &m);
  do {
    c++;
    for (int i = 1; i <= n; i++) {
      ar[c][i] = a[i];
      for (int j = i; j <= n; j++) {
        int y = *min_element(a + i, a + j + 1);
        val[c] += y;
      }
    }
    mx = max(mx, val[c]);
  } while (next_permutation(a + 1, a + n + 1));
  int h = 0;
  for (int i = 1; i <= c; i++) {
    if (mx == val[i]) {
      h++;
      if (m == h) {
        for (int k = 1; k <= n; k++) {
          if (k > 1) printf(" ");
          printf("%d", ar[i][k]);
        }
        break;
      }
    }
  }
  return 0;
}
