#include <stdio.h>
#include <stdlib.h>

#define natural unsigned short // csf sa mai pierd timp
#define maxN 10000
unsigned v[maxN], n, m, j;

void Init(natural k) {
	v[k] = 0;
}
natural Succesor(natural k) {
	if (v[k] < n) {
		v[k]++;
		return 1;
	}
	return 0;
}

natural Valid(natural k) {
	natural i;
	for (i = 1; i < k; i++)
		if (v[i] >= v[k]) return 0;

	return 1;
}

natural Solution(natural k) {
	return (k == j);
}

void Print() {
	natural i;
	printf("%d : ", ++m);
	for (i = 1; i <= j; i++)
		printf("%d ", v[i]);
	printf("\n");
}

void Back() {
	natural k = 1, isS, isV;
	Init(k);
	while (k > 0) {
		isS = 0; isV = 0;
		if (k <= n)
			do {
				isS = Succesor(k);
				if (isS) isV = Valid(k);
			} while (isS && !isV);
			if (isS)
				if (Solution(k))
					Print();
				else {
					k++;
					Init(k);
				}
			else
				k--;
	}
}

int main() {
	do {
		system("cls");
		printf("n = "); scanf("%d", &n);
		printf("j = "); scanf("%d", &j);// nu mi-a venit alt nume mai bun
	} while (n >= maxN && j > n);
	printf("Combinarile sunt: \n");
	Back();
	system("pause");
	return 0;

}