#include "Joi.h"
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template<class T> ostream& operator<<(ostream& stream, const vector<T> v){ stream << "[ "; for (int i=0; i<(int)v.size(); i++) stream << v[i] << " "; stream << "]"; return stream;}
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
const int N = 1e6 + 5;
static vi Euler;
static int was[N];
static int ok[N];
static vi g[N];
static int T = -1;
static void dfs(int node,int prev) {
T = (T + 1) % 60;
ok[Euler.size()] = T;
Euler.pb(node);
for (auto it : g[node])
if (it != prev) {
dfs(it,node);
Euler.pb(node);
}
}
static int f[N];
static int get(int k) {
return k == f[k] ? k : f[k] = get(f[k]);
}
static int n;
void Joi(int N, int M, int A[], int B[], long long X, int T) {
srand(696969);
memset(ok,-1,sizeof(ok));
n = N;
for (int i = 0;i < n;++i)
f[i] = i;
for (int i = 0;i < M;++i) {
if (get(A[i]) == get(B[i]))
continue;
g[A[i]].pb(B[i]);
g[B[i]].pb(A[i]);
f[get(A[i])] = get(B[i]);
}
dfs(rand() % n,-1);
int sz = Euler.size();
for (int i = 0;i < sz;++i)
if (ok[i] != -1)
MessageBoard(Euler[i],(X >> ok[i]) & 1);
}
#include "Ioi.h"
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template<class T> ostream& operator<<(ostream& stream, const vector<T> v){ stream << "[ "; for (int i=0; i<(int)v.size(); i++) stream << v[i] << " "; stream << "]"; return stream;}
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
const int N = 1e6 + 5;
static vi Euler;
static int was[N];
static int ok[N];
static int W[N];
static vi g[N];
static int T = -1;
static void dfs(int node,int prev) {
T = (T + 1) % 60;
ok[Euler.size()] = T;
W[node] = T;
Euler.pb(node);
for (auto it : g[node])
if (it != prev) {
dfs(it,node);
Euler.pb(node);
}
}
static int f[N];
static int get(int k) {
return k == f[k] ? k : f[k] = get(f[k]);
}
static int n;
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
srand(696969);
memset(ok,-1,sizeof(ok));
n = N;
for (int i = 0;i < n;++i)
f[i] = i;
for (int i = 0;i < M;++i) {
if (get(A[i]) == get(B[i]))
continue;
g[A[i]].pb(B[i]);
g[B[i]].pb(A[i]);
f[get(A[i])] = get(B[i]);
}
dfs(rand() % n,-1);
int sz = Euler.size();
ll mask = (1ll << 60) - 1;
int pos = -1;
for (int i = 0;i < sz;++i)
if (Euler[i] == P) {
pos = i;
break;
}
ll answer = 0;
answer |= V * (1ll << W[Euler[pos]]);
mask ^= (1ll << W[Euler[pos]]);
for (int i = (pos + 1) % sz,j = pos;mask;i = (i + 1) % sz,j = (j + 1) % sz) {
if (Euler[i] == Euler[j])
continue;
int nxt = Move(Euler[i]);
if (mask & (1ll << W[Euler[i]])) {
mask ^= 1ll << W[Euler[i]];
answer |= nxt * (1ll << W[Euler[i]]);
}
}
return answer;
}
