#include <bits/stdc++.h>
using namespace std;
using ll = long long;

vector<int> v;
vector<pair<int, int>> q;

int check(int n)
{
    int side = 0;
    for (auto [c, x] : q)
    {
        if (v[n] == c)
            n += x;
        if (n < 0)
        {
            side = -1;
            break;
        }
        if (n >= v.size())
        {
            side = 1;
            break;
        }
    }
    return side;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, k, m;
    cin >> n >> k >> m;
    v.resize(n);
    q.resize(m);
    for (int i = 0; i < n; i++)
    {
        cin >> v[i];
    }
    for (int i = 0; i < m; i++)
    {
        cin >> q[i].first >> q[i].second;
    }
    int ans = 0;
    int l = -1, r = n;

    while (l + 1 < r)
    {
        int cur = (l + r) / 2;
        int side = check(cur);
        if (side == -1)
        {
            l = cur;
        }
        else
        {
            r = cur;
        }
    }
    ans += l + 1;

    l = -1;
    r = n;
    while (l + 1 < r)
    {
        int cur = (l + r) / 2;
        int side = check(cur);
        if (side == 1)
        {
            r = cur;
        }
        else
        {
            l = cur;
        }
    }
    ans += n - r;
    cout << ans;
}