#include<stdio.h>
int n,m,sol[101];
int check(int val,int k){
    int j;
    if(val<sol[k-1])
        return 0;
    for(j=1; j<k; ++j) 
        if(sol[j]==val)
            return 0;
    return 1;}
void back(int k){
    if(k==m+1){
        for(int j=1; j<=m; ++j)
            printf("%d ",sol[j]);
        printf("\n");}
    else
        for(int val=1; val<=n; ++val)
            if(check(val,k)){
                    sol[k]=val;
                    back(k+1);}}
int main(){
    freopen("combinari.in","r",stdin);
    freopen("combinari.out","w",stdout);
    scanf("%d%d",&n,&m);
    back(1);
    return 0;}