''' #include<bits/stdc++.h> using namespace std; vector<vector> res; void bfs(vector& r, stack& st, vector& c, int index, int n) { if(c.size() == n){ res.push_back(c); return; } if(!st.empty()){ int val = st.top(); st.pop(); c.push_back(val); bfs(rr, st, c, index, n); c.pop_back(); st.push(val); } if(index < n){ st.push(rr[index]); bfs(r, st, c, index + 1, n); st.pop(); } } int main() { int n, k; cin >> n >> k; vector a(n); for(int i = 0; i < n;i++){ cin >> a[i]; } stack st; vector c; bfs(ar, st, c, 0, n); sort(res.begin(), res.end()); for (int i = 0; i < k; i++) { for (int j = 0; j < n;j++) { cout << res[i][j]; if (j != n - 1) { cout << " "; } } cout << '\n'; } return 0; }