package main

import (
	"bufio"
	"os"
	"strconv"
	"fmt"
	"sort"
)

type Scanner struct {
	r   *bufio.Reader
	buf []byte
	p   int
}

func NewScanner() *Scanner {
	rdr := bufio.NewReaderSize(os.Stdin, 1000)
	return &Scanner{r:rdr}
}
func (s *Scanner) Next() string {
	s.pre()
	start := s.p
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			break
		}
	}
	result := string(s.buf[start:s.p])
	s.p++
	return result
}
func (s *Scanner) NextLine() string {
	s.pre()
	start := s.p
	s.p = len(s.buf)
	return string(s.buf[start:])
}
func (s *Scanner) NextInt() int {
	v, _ := strconv.Atoi(s.Next())
	return v
}

func (s *Scanner) NextIntArray() []int {
	s.pre()
	start := s.p
	result := []int{}
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			v, _ := strconv.Atoi(string(s.buf[start:s.p]))
			result = append(result, v)
			start = s.p + 1
		}
	}
	v, _ := strconv.Atoi(string(s.buf[start:s.p]))
	result = append(result, v)

	return result
}

func (s *Scanner) NextMap() map[int]bool {
	s.pre()
	start := s.p
	mp := map[int]bool{}
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			v, _ := strconv.Atoi(string(s.buf[start:s.p]))
			mp[v] = true
			start = s.p + 1
		}
	}
	v, _ := strconv.Atoi(string(s.buf[start:s.p]))
	mp[v] = true

	return mp
}

func (s *Scanner) pre() {
	if s.p >= len(s.buf) {
		s.readLine()
		s.p = 0
	}
}
func (s *Scanner) readLine() {
	s.buf = make([]byte, 0)
	for {
		l, p, e := s.r.ReadLine()
		if e != nil {
			panic(e)
		}
		s.buf = append(s.buf, l...)
		if !p {
			break
		}
	}
}

func main() {
	var N, K, X int
	fmt.Scan(&N, &K, &X)
	A := make([]int, K)
	B := make([]int, K)
	for i := 0; i < K; i++ {
		if i != X - 1 {
			fmt.Scan(&A[i], &B[i])
			A[i]--
			B[i]--
		} else {
			var s1, s2 string
			fmt.Scan(&s1, &s2)
		}
	}
	C := make([]int, N)
	D := make([]int, N)
	for i := 0; i < N; i++ {
		fmt.Scan(&D[i])
		C[i] = i + 1
	}

	for i := 0; i < X; i++ {
		C[A[i]], C[B[i]] = C[B[i]], C[A[i]]
	}
	for i := K - 1; i > X - 1; i-- {
		D[A[i]], D[B[i]] = D[B[i]], D[A[i]]
	}

	ans := make([]int, 2)
	p := 0

	for i := 0; i < N; i++ {
		if C[i] != D[i] {
			ans[p] = i + 1
			p++
		}
	}
	sort.Ints(ans)
	fmt.Println(ans[0], ans[1])

}