#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
#define Max 100001

int n,m,x[20];

void comb(int k)
{
	if(x[k] < k+n-m)
	{
		x[k]++;
		return;
	} else
	comb(k-1);
	x[k]=x[k-1]+1;
}

int main()
{
	freopen("combinari.in","r",stdin);
	freopen("combinari.out","w",stdout);
		scanf("%d %d",&n,&m);
		
		for(int i=1;i<=m;i++)x[i]=i;
		do{
			for(int i=1;i<=m;i++)printf("%d ",x[i]);
			printf("\n");
			comb(m);
		}while(x[0]==0);

	return 0;
}