#include <stdio.h>
#include <iostream>
#include <cstring>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#include <string>
#include <vector>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <limits.h>
#include <algorithm>
#include <deque>
#define nmax 100010
#define mod 1999999973
using namespace std;
int n,k,fr[20],t[20];
void back(int x)
{
    if (x==k+1) {
        for (int i=1;i<=k;i++) printf("%d ",t[i]);
        printf("\n");
        return;
    }
    for (int i=t[x-1]+1;i<=n;i++)
        if (fr[i]==0) { t[x]=i; fr[i]=1; back(x+1); fr[i]=0; }
}
int main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
back(1);
return 0;
}