#include <cstdio>
#include <string>
#include <algorithm>
using namespace std;
int n,k,i;
string s,c;
int main()
{
    freopen("combinari.in","r",stdin);
    freopen("combinari.out","w",stdout);
    scanf("%d%d",&n,&k);
    for(i=1;i<=k;i++)s+='1';
    for(;i<=n;i++)s+='0';

    reverse(s.begin(),s.end());
    c=s;
    for(;;)
    {
        for(i=n-1;i>=0;i--)if(s[i]=='1')printf("%d ",n-i);
        printf("\n");
        next_permutation(s.begin(),s.end());
        if(s==c)break;
    }
    return 0;
}