#include<cstdio>

#include<iostream>

#include <iterator>

#include<string>

#include<cstring>

#include<queue>

#include<vector>

#include<stack>

#include<vector>

#include<map>

#include<set>

#include<algorithm>

using namespace std;

int n,tar;

const int maxn = ;

int a[maxn];

int C[maxn][maxn];

inline bool ok()

{

    int re = ;

    for(int i = ; i < n; i++){

        re += a[i]*C[n-][i];

    }

    return re == tar;

}

//#define LOCAL

int main()

{

#ifdef LOCAL

    freopen("in.txt","r",stdin);

#endif

    for(int i = ; i < maxn; i++){

        C[i][] = C[i][i] = ;

        for(int j = ; j < i; j++){

            C[i][j] = C[i-][j] + C[i-][j-];

        }

    }

    scanf("%d%d",&n,&tar);

    for(int i = ; i < n; i++)a[i] = i+;

    while(!ok() && next_permutation(a,a+n));

    copy(a, a + n, ostream_iterator<int>(cout, " "));

    return ;

}