#include<cstdio>

const int maxn = 30;

int n , k , i , p , s[maxn];

void print() {
	int i;
	for( i = 0 ; i < k ; ++i ) printf("%d ",s[i]);
	printf("\n");
}

void back(int p) { 
	
	int i;
	
	if ( p == k ) print();
	else {
			for( i = s[p - 1] + 1 ; i <= n ; ++i ){
				s[p] = i;
				back(p + 1);
			}
	}
}

int main()
{
	freopen("combinari.in","r", stdin);
	freopen("combinari.out","w",stdout);
	
	scanf("%d %d",&n,&k);
	
	back(0);
	
return 0;
}