#include "king.h"
#include <algorithm>
using namespace std;
long long SendInfo(vector<int> W, vector<int> C) {
int N = W.size();
long long ret = 0;
for(int i=N-1;i>=0;i--) {
ret += W[i];
if(i==0) break;
ret *= 10;
}
return ret;
}
#include "vassal.h"
#include <algorithm>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
vector<int> ans[12];
long long BB;
void Init(long long B, vector<int> C){
int N = C.size();
BB = B;
// ToDo
int W[12]= {};
vector<pii> ws, cs;
for(int i=0;i<N;i++) {
cs.push_back({C[i], i});
}
sort(cs.begin(), cs.end());
for(int i=0;i<N;i++) {
W[i] = B%10;
B/=10;
ws.push_back({W[i], i});
}
sort(ws.begin(), ws.end());
for(int i=0;i<N;i++) {
if(ws[i].first<=cs[i].first) {
ans[ws[i].first].push_back(cs[i].second);
}
}
}
int Maid(int W){
if(ans[W].size()==0) return -1;
int ret = ans[W][ans[W].size()-1];
ans[W].pop_back();
return ret;
}
