#include "Joi.h"
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
namespace {
using ll = long long;
using PLL = pair<ll, ll>;
template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }
constexpr ll inf = 1e18;
}
void Joi(int N, int M, int A[], int B[], long long X, int T) {
rep (i, N) {
if (i < 60) MessageBoard(i, X >> i & 1);
else MessageBoard(i, 0);
}
}
#include "Ioi.h"
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
namespace {
using ll = long long;
using PLL = pair<ll, ll>;
template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }
constexpr ll inf = 1e18;
}
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
vector<ll> memo(N, -1);
vector<vector<int>> G(N);
rep (i, M) {
G[A[i]].push_back(B[i]);
G[B[i]].push_back(A[i]);
}
memo[P] = V;
auto dfs = [&](auto&& self, int v) -> void {
for (auto e : G[v]) {
if (memo[e] != -1) continue;
memo[e] = Move(e);
self(self, e);
Move(v);
}
};
dfs(dfs, P);
ll X = 0;
rep (i, 60) X |= memo[i] << i;
return X;
}
