#include <cstdio>
#include <vector>
#include "Annalib.h"

using namespace std;

#define X first
#define Y second
#define PB push_back

const int MAXN = 1e5 + 500;

vector < int > v[MAXN];
int dis[MAXN];

void dfs(int x, int lst) {
    dis[x] = dis[lst] + 1;
    for(int y : v[x])
        if(y != lst) dfs(y, x);
}

void Anna(int ty, int n, int t, int v1[], int v2[]) {
    for(int i = 0;i < n - 2;i++) {
        v[v1[i]].PB(v2[i]);
        v[v2[i]].PB(v1[i]);
    }
    dfs(t, t);
    if(ty <= 2) {
        for(int i = 1;i <= n;i++)
            Flag(i, dis[i] % 3);
    } else {
        for(int i = 1;i <= n;i++) {
            Flag(i, dis[i] % 4 == 0 || dis[i] % 4 == 3);
        }
    }
}

#include <cstdio>
#include "Brunolib.h"

void Bruno(int ty, int cur, int my, int len, int sus[], int flg[]){
    if(ty <= 2) {
        for(int i = 0;i < len;i++) {
            if(flg[i] == (my + 2) % 3) {
                Answer(sus[i]); return;
            }
        }
        Answer(cur); return;
    } else {
        int cnt[2] = {0, 0};
        for(int i = 0;i < len;i++) {
            cnt[flg[i]]++;
        }    
        if(!cnt[0] || !cnt[1]) {
            Answer(cur);
        } else {
            for(int i = 0;i < len;i++) 
                if(cnt[flg[i]] == 1)
                    Answer(sus[i]);
        }
    }
}