#include <cstdio>
#include <cmath>

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define inc( i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec( i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

typedef long long   signed int LL;
typedef long long unsigned int LU;

template<typename T> void swap(T &x, T &y) { T t = x; x = y; y = t; return; }
template<typename T> T abs(T x) { return (0 <= x ? x : -x); }
template<typename T> T max(T a, T b) { return (b <= a ? a : b); }
template<typename T> T min(T a, T b) { return (a <= b ? a : b); }
template<typename T> bool setmin(T &a, T b) { if(a <= b) { return false; } else { a = b; return true; } }
template<typename T> bool setmax(T &a, T b) { if(b <= a) { return false; } else { a = b; return true; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int n, k, x, a[100000], b[100000], c[100000];

int d[100000];

int main() {
	scanf("%d%d%d", &n, &k, &x); x--;
	inc(i, k) {
		if(i != x) { scanf("%d%d", &a[i], &b[i]); a[i]--; b[i]--; }
		else { scanf("%*s%*s"); }
	}
	inc(i, n) { scanf("%d", &c[i]); }
	
	inc(i, n) { d[i] = i + 1; }
	inc(i, k) {
		if(i != x) { swap(d[ a[i] ], d[ b[i] ]); }
	}
	
	int e[2], f = 0;
	inc(i, n) {
		if(d[i] != c[i]) { e[f++] = i; }
	}
	
	inc(i, n) { d[i] = 0; }
	d[ e[0] ] = 1;
	d[ e[1] ] = 1;
	decID(i, x + 1, k) { swap(d[ a[i] ], d[ b[i] ]); }
	
	int g[2], h = 0;
	inc(i, n) {
		if(d[i] != 0) { g[h++] = i; }
	}
	
	printf("%d %d\n", g[0] + 1, g[1] + 1);
	
	return 0;
}