#include <stdio.h>

int s[100];
int n,k,m;

FILE *f = fopen("combinari.in", "r");
FILE *g = fopen("combinari.out", "w");

int cont(int k) {

//	for (int i=1; i<k; i++)
//		if (s[i]==s[k])
//			return 0;
	return 1;
}

void sol() {
	for (int i=1; i<=m; i++)
		fprintf(g,"%d ",s[i]);
	fprintf(g,"\n");
}

int main(){

	fscanf(f,"%d %d",&n,&m);

	k = 1;
	s[k] = 0;

	while (k > 0)
		if (s[k] < n) {
			s[k]++;
			if (cont(k))
				if (k==m)
					sol();
				else {
					k++;
					s[k] = s[k-1];
				}
			}
		else
			k--;

	fclose(f);
	fclose(g);

  return 0;
}