#include <cassert>

#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define ll long long
#define Sort(v) sort(all(v))
#define INF 1000000000
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin() , (v).end()
#define MP make_pair
#define MOD 1000000007LL;
using namespace std;
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};

void printv(vector<int> v){
    rep(i,0,v.size())cout<<v[i]<<" ";
    cout<<endl;
}

int main(){
    int n,k,x;
    cin>>n>>k>>x;
    x--;
    vector<pair<int,int>> v(k);
    vector<int> c(n),s(n);
    rep(i,0,k){
        if(i!=x)cin>>v[i].fi>>v[i].se;
        else {
            char x,xx;
            cin>>x>>xx;
        }
        v[i].fi--;
        v[i].se--;
        //cout<<v[i].fi<<" "<<v[i].se<<endl;
    }
    rep(i,0,n){
        s[i]=i+1;
        cin>>c[i];
    }
    rep(i,0,x){
        swap(s[v[i].fi],s[v[i].se]);
        //cout<<"s:";printv(s);
    }
    for(int i=k-1;i>x;i--){
        swap(c[v[i].fi],c[v[i].se]);
        //cout<<v[i].fi<<v[i].se<<endl;
        //cout<<"c:";printv(c);
    }

    vector<int> ans;
    rep(i,0,n){
        if(s[i]!=c[i])ans.pb(i);
    }
    cout<<ans[0]+1<<" "<<ans[1]+1<<endl;
    
    
    
    


    return 0;
}