#include <bits/stdc++.h>
#include "Annalib.h"
const int N = 100010;
namespace gf {
	int h[N], c;
	struct node {
		int nxt, to;
	} a[N];
	void init () {
		c = 0;
		memset (h, 0, sizeof (h));
	}
	void add (int x, int y) {
		a[++c].nxt = h[x];
		a[c].to = y;
		h[x] = c;
		a[++c].nxt = h[y];
		a[c].to = x;
		h[y] = c;
	}
}
#define gffor(gf,i,u) for (int i = gf::h[u]; i != 0; i = gf::a[i].nxt)
int flag[N];
void dfs (int u, int fa) {
	gffor (gf, i, u) {
		int v = gf::a[i].to;
		if (v == fa) {
			continue;
		}
		if (v > u) {
			flag[v] = (flag[u] ^ 1);
		} else {
			flag[v] = flag[u];
		}
		dfs (v, u);
	}
}
void Anna (int K, int N, int T, int A[], int B[]) {
	for (int i = 0; i <= N - 2; i++) {
		gf::add (A[i], B[i]);
	}
	dfs (T, -1);
	for (int i = 1; i <= N; i++) {
		Flag (i, flag[i]);
	}
}

#include "Brunolib.h"
void Bruno (int K, int S, int F, int L, int P[], int Q[]) {
	for (int i = 0; i < L; i++) {
		if ((S < P[i]) ^ F ^ Q[i]) {
			Answer (P[i]);
			return;
		}
	}
	Answer (S);
	return;
}