15650번

15650

#include <iostream>
using namespace std;
int n, m;
int list[8];
bool visit[9];

void dfs(int num, int cnt) {
	if (cnt == m) {
		for (int i = 0; i < m; i++) {
			cout << list[i] << " ";
		}
		cout << "\n";
		return;
	}
	for (int i = num; i <= n; i++) {
		if (!visit[i]) {
			list[cnt] = i;
			visit[i] = true;
			dfs(i + 1, cnt + 1);
			visit[i] = false;
		}
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	cin >> n >> m;
	dfs(1, 0);
}