d13school

//Make CSP great again
//You're as beautiful as the day I lost you
#include <bits/stdc++.h>
#define TASK "TESTCODE"
using namespace std;
const int N = 2e5, oo = 1e9;
int n, m, q, Num[N + 1], s[N + 1];
vector<int> Adj[N + 1];
int d[N + 1];
struct SegmentTree
{
    int Tree[4 * N + 1];
    void BuildTree(int v, int TreeL, int TreeR)
    {
        if (TreeL == TreeR)
        {
            Tree[v] = d[TreeL] + Num[TreeL];
            return ;
        }
        int mid = (TreeL + TreeR)/2;
        BuildTree(v * 2, TreeL, mid);
        BuildTree(v * 2 + 1, mid + 1, TreeR);
        Tree[v] = min(Tree[2 * v], Tree[2 * v + 1]);
    }
    void Update(int v, int TreeL, int TreeR, int pos, int val)
    {
        if (TreeL == TreeR)
        {
            Tree[v] = val;
            return ;
        }
        int mid = (TreeL + TreeR)/2;
        if (pos <= mid)
        {
            Update(v * 2, TreeL, mid, pos, val);
        }
        else
        {
            Update(v * 2 + 1, mid + 1, TreeR, pos, val);
        }
        Tree[v] = min(Tree[2 * v], Tree[2 * v + 1]);
    }
    int Get()
    {
        return Tree[1];
    }
};
SegmentTree Tree;
void read()
{
    cin >> n >> m >> q;
    while(m--)
    {
        int u, v;
        cin >> u >> v;
        Adj[v].push_back(u);
    }
    fill(d + 1, d + n + 1, oo);
    for (int i = 1; i <= n; ++ i)
    {
        cin >> s[i];
        Num[s[i]] = i - 1;
    }
}
void BFS()
{
    queue<int> Q;
    d[n] = 0;
    Q.push(n);
    while(!Q.empty())
    {
        int u = Q.front();
        Q.pop();
        for (int v : Adj[u])
        {
            if (d[v] > d[u] + 1)
            {
                d[v] = d[u] + 1;
                Q.push(v);
            }
        }
    }
}
void solve()
{
    BFS();
    Tree.BuildTree(1, 1, n);
    while(q--)
    {
        int i, j;
        cin >> i >> j;
        int u = s[i], v = s[j];
        swap(s[i], s[j]);
        swap(Num[u], Num[v]);
        Tree.Update(1, 1, n, u, Num[u] + d[u]);
        Tree.Update(1, 1, n, v, Num[v] + d[v]);
        cout << Tree.Get() << '\n';
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
        //freopen(TASK".OUT", "w", stdout);
    }
    int t = 1;
    bool typetest = false;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        //cout << "Case " << __ << ": ";
        read();
        solve();
    }
}