surinoel

#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

int n, m;
bool visit[9];
vector<int> num;
vector<vector<int>> ans;

surinoel

#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

int n, m;
bool visit[9];
vector<int> num;

surinoel

#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

int n, m;
bool visit[9];
vector<int> num;

surinoel

#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

int n, m;
bool visit[9];
vector<int> num;

surinoel

#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

int n, m;
bool visit[9];
vector<int> num;

surinoel

#include <vector>
#include <iostream>

using namespace std;

int n, m;

void go(int idx, int maxcnt, vector<int> v) {
	if (maxcnt == m) {
		for (int i = 0; i < v.size(); i++) {

surinoel

#include <vector>
#include <iostream>

using namespace std;

int n, m;

void go(int maxcnt, vector<int> v) {
	if (maxcnt == m) {
		for (int i = 0; i < v.size(); i++) {

surinoel

#include <vector>
#include <iostream>

using namespace std;

int n, m;
bool visit[9];

void go(int idx, int maxcnt, vector<int> v) {
	if (maxcnt == m) {

surinoel

#include <vector>
#include <iostream>

using namespace std;

int n, m;
bool visit[9];

void go(int maxcnt, vector<int> v) {
	if (maxcnt == m) {

surinoel

#include <string>
#include <iostream>

using namespace std;

int main(void) {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int n;