#include using namespace std; const int N = 30; int n, k, ans[N];

void dfs(int x, int last) { if (x == k + 1) { for (int i = 1; i <= k; i++) printf("%3d", ans[i]); cout << endl; return ; }

//for (int i = last + 1; i <= n; i++) {
	//ans[x] = i;
//	dfs(x + 1, i);
//}

//}

//int main() { //cin >> n >> k; //dfs(1, 0); //return 0; }