#include <vector>
#include <string>
#include <numeric>
#include <algorithm>
#include "messy.h"
using namespace std;
vector<int> restore_permutation(int n, int w, int r) {
string base; for(int ap = 0; ap < n; ap++) base += "0";
vector<int> perm; iota(perm.begin(), perm.end(), 0); random_shuffle(perm.begin(), perm.end());
for(int adder = 0; adder < n; adder++){
base[adder] = '1';
add_element(base);
}
compile_set();
for(int z = 0; z < n; z++) base[z] = '0';
vector<int> ret (n, -1);
for(int permer = 0; permer < n; permer++){
for(int c = 0; c < n; c++){
if(base[c] == '0'){
base[c] = '1';
if(check_element(base)){
ret[c] = permer;
break;
}
else base[c] = '0';
}
}
}
return ret;
}
/*
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <cstdlib>
#include <iostream>
#include "messy.h"
using namespace std;
namespace helper {
set<string> set_;
bool compiled = false;
int n;
vector<int> p;
int w;
int r;
int read_int() {
int x;
cin >> x;
return x;
}
}
using namespace helper;
// A convenience function.
int get_p(int i) {
int ret = p[i];
return ret;
}
int main() {
n = read_int();
w = read_int();
r = read_int();
p = vector<int>(n);
for (int i = 0; i < n; i++) {
p[i] = read_int();
}
vector<int> answer = restore_permutation(n, w, r);
if (answer.size() != n) {
printf("WA\n");
return 0;
}
printf("%d", answer[0]);
for (int i = 1; i < n; i++) {
printf(" %d", answer[i]);
}
printf("\n");
return 0;
}
void wa() {
printf("WA\n");
exit(0);
}
bool check(const string& x) {
if ((int)x.length() != n) {
return false;
}
for (int i = 0; i < n; i++) {
if (x[i] != '0' && x[i] != '1') {
return false;
}
}
return true;
}
void add_element(string x) {
if (--w < 0 || compiled || !check(x)) {
wa();
}
set_.insert(x);
}
bool check_element(string x) {
if (--r < 0 || !compiled || !check(x)) {
wa();
}
return set_.count(x);
}
void compile_set() {
if (compiled) {
wa();
}
compiled = true;
set<string> compiledSet;
string compiledElement = string(n, ' ');
for (set<string>::iterator it = set_.begin(); it != set_.end(); it++) {
string s = *it;
for (int i = 0; i < n; i++) {
compiledElement[i] = s[get_p(i)];
}
compiledSet.insert(compiledElement);
}
set_ = compiledSet;
}
*/
