#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
ifstream fin("farfurii.in");
ofstream fout("farfurii.out");
vector <int> a;
int k,n,ct=0;
int verific()
{
    while (next_permutation(a.begin(),a.end()))
    {
        ct=0;
        for (int i=0; i<n; i++)
        {
            for (int j=i+1; j<n; j++)
            {
                if (a[i]>a[j])
                    ct++;
            }
        }
        if (ct==k)
        {
            for (int i=0; i<n; i++)
            {
                fout<<a[i]<<" ";
            }
            return 0;
        }
    }
}
int main ()
{
    fin>>n>>k;
    for (int i=1; i<=n; i++)
    {
        a.push_back(i);
    }
    if (k==0)
    {
        for (int i=0; i<n; i++)
        {
            fout<<a[i]<<" ";
        }
    }
    verific();
}