#include <stdio.h>

#define nm 20

int n, k, a[nm];

void read()

{
	scanf("%d %d ", &n, &k);
}


void back(int p)

{
	if (p > k)
	{
		int i;
		for (i=1; i<=k; ++i)
		{
			printf("%d ", a[i]);
		}
		printf("\n");
	}
	else
	{
		int i;
		for (i=a[p-1]+1; i<=n; ++i)
		{
			a[p] = i;
			back(p+1);
		}
	}

}


void solve()

{
	a[0] = 0;
	back(1);
}


int main()

{
	freopen("combinari.in", "r", stdin);
	freopen("combinari.out","w",stdout);

	read();
	solve();

	return 0;
}