#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <set>
#include <vector>
#include <queue>
using namespace std;
signed main()
{
int n,m,k;
vector<int>g[10010];
int dist[10010];
cin>>n>>m>>k;
for(int i=1,a,b;i<=m;i++)
{
cin>>a>>b;
g[a].push_back(b);
g[b].push_back(a);
}
for(int i=0;i<k;i++)
{
memset(dist,0,sizeof dist);
int x;cin>>x;
queue<int>q;
q.push(x);dist[x]=1;
while(q.size())
{
int u=q.front();q.pop();
for(auto v : g[u])
{
if(dist[v])continue;
q.push(v);
dist[v]=dist[u]+1;
}
}
int maxv=1,pos=0;
for(int j=1;j<=n;j++)
{
if(dist[j]>maxv)
{
maxv=dist[j];
pos=j;
}
}
cout<<pos<<endl;
}
}
03-24
195