//
//  429.cpp
//  yukicoder
//
//  Created by KITAZUMI on 2016/11/08.
//  Copyright © 2016年 KITAZUMI. All rights reserved.
//

#include<iostream>

using namespace std;

int main(){
    int N, K, X;
    int A[100000];
    int B[100000];
    int C[100000];
    int S[100000];
    int tmp;
    int ans1, ans2;
    int flag = 0;
    cin >> N >> K >> X;
    ans1 = 0;
    ans2 = 0;
    for(int i = 0; i < K; i++){
        cin >> A[i] >> B[i];
    }
    for(int i = 0; i < N; i++){
        cin >> C[i];
    }
    for(int i = 0; i < N; i++){
        S[i] = i+1;
    }
    for(int i = 0; i < X-1; i++){
        tmp = S[A[i]];
        S[A[i]] = S[B[i]];
        S[B[i]] = tmp;
    }
    for(int i = N-1; i > X-1; i--) {
        tmp = C[A[i]];
        C[A[i]] = C[B[i]];
        C[B[i]] = tmp;
    }
    for(int i = 0; i < N; i++){
        if(S[i] != C[i] && flag == 0){
            ans1 = i;
            flag = 1;
        }
        else if(S[i] != C[i] && flag == 1){
            ans2 = i;
            break;
        }
        else{
            continue;
        }
    }
    cout << ans1 << ans2 << endl;
    return 0;
}