#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
using namespace std;
int N,K,X;
int a[100001],b[100001],c[100001],x[100001];
int main(){
  cin >> N >> K >> X;
  for(int i=1;i<=K;i++){
    if(i==X) {
      char s,t;
      scanf(" %c",&s);
      scanf(" %c",&t);
      //fflush(stdin);
    }
    else cin >> a[i] >> b[i];
  }
  for(int i=1;i<=N;i++)cin >> c[i];
  for(int i=1;i<=N;i++)x[i]=i;

  for(int i=1;i<X;i++){
    int temp=x[a[i]];
    x[a[i]]=x[b[i]];
    x[b[i]]=temp;
  }
  for(int i=K;i>X;i--){
    int temp=c[a[i]];
    c[a[i]]=c[b[i]];
    c[b[i]]=temp;
  }
  for(int i=1;i<=N;i++){
    if(x[i]!=c[i]){
      int temp=x[i];
      x[i]=c[i];
      c[i]=temp;
      cout << i ;
      if(i==N)cout << endl;
      else cout << " ";
    }
  }
  return 0;
}