[BOJ] 15651. N과M(3)

#include <iostream>
#include <vector>
using namespace std;
int n, m;
vector <int> v;
void dfs(int cnt) {
    if (cnt == m) {
        for (int i = 0; i < m; i++) {
            cout << v[i] << ' ';
        }cout << '\n';
        return;
    }
    for (int i = 1; i <= n; i++) {
        v.push_back(i);
        dfs(cnt+1);
        v.pop_back();
    }
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        v.push_back(i);
        dfs(1);
        v.pop_back();
    }
}