#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
const int maxn = 2001;
int n;
bool fg;
vector < int > g[maxn];
vector < bool > rec;
}
void InitA(int N, int A, vector< int > U, vector< int > V, vector < int > C){
n = N;
}
void ReceiveA(bool x){
rec.push_back(x);
}
vector < int > Answer(){
vector < int > ans(n);
reverse(rec.begin(), rec.end());
for(int i = 0; i < n; i++){
for(int bit = 19; bit >= 0; bit--){
ans[i] |= (rec.back() << bit);
rec.pop_back();
}
}
return ans;
}
#include "Baijan.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
const int maxn = 2000;
const int inf = 1123123123;
int n;
int d[maxn];
vector < pair < int, int > > g[maxn];
void dijkstra(int s){
set < pair < int, int > > q;
fill(d, d + maxn, inf);
d[s] = 0, q.insert({d[s], s});
while(!q.empty()){
int v = (q.begin() -> second);
q.erase(q.begin());
for(auto [u, w] : g[v])
if(d[v] + w < d[u])
q.erase({d[u], u}),
d[u] = d[v] + w,
q.insert({d[u], u});
}
}
}
void InitB(int N, int B, std::vector<int> S, std::vector<int> T, std::vector<int> D) {
n = N;
for(int i = 0; i < B; i++)
g[S[i]].push_back({T[i], D[i]}), g[T[i]].push_back({S[i], D[i]});
dijkstra(0);
for(int i = 0; i < n; i++)
for(int bit = 19; bit >= 0; bit--)
SendB((d[i] >> bit & 1));
}
void ReceiveB(bool y) {
}
