#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;

int n, k, m;
vector<int> szobak;
vector<pii> kerdesek;

int jo(int akt){
    for(pii x : kerdesek){
        if(szobak[akt] == x.first){
            akt += x.second;
        }

        if(akt == -1){
            return -1;
        } else if(akt == n){
            return 1;
        }
    }
    return 0;
}

int main()
{
    cin >> n >> k >> m;

    szobak.assign(n, 0);
    for(int i = 0; i < n; i++){
        cin >> szobak[i];
    }

    kerdesek.assign(m, {0, 0});
    for(pii &x : kerdesek){
        cin >> x.first >> x.second;
    }

    int balH = -1;
    int l = 0, r = n - 1;
    while(l <= r){
        int mid = (l + r) / 2;

        if(jo(mid) == -1){
            balH = mid;
            l = mid + 1;
        } else{
            r = mid - 1;
        }
    }

    int jobbH = n;
    l = 0;
    r = n - 1;
    while(l <= r){
        int mid = (l + r) / 2;

        if(jo(mid) == 1){
            jobbH = mid;
            r = mid - 1;
        } else{
            l = mid + 1;
        }
    }

    cout << (balH + 1) + (n - jobbH) << "\n";
}