#include <fstream>
#include <algorithm>

using namespace std;

ifstream f("farfurii.in");
ofstream g("farfurii.out");

int n,k,a[100001],gasit=0;
int checkv()
{
    int c=0;
    for(int i=1;i<n;i++)
        for(int j=i+1;j<=n;j++)
         if(a[i]>a[j]) c++;
    if(c==k) return 1;
    return 0;
}

int main()
{
    f>>n>>k;
    for(int i=1;i<=n;i++)
        a[i]=i;
    while(gasit==0)
    {
        next_permutation(a, a+n+1);
        if(checkv())
            gasit=1;
    }
    for(int i=1;i<=n;i++)
        g<<a[i]<<" ";
    return 0;
}