#include <bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define endl "\n"
#define pll pair<ll, ll>
#define fs first
#define sc second
#define vll vector<ll>
#define v2d vector<vector<ll>>
#define vpll vector<pll>
#define qll queue<ll>
#define stll stack<ll>
#define sll set<ll>
#define mll map<ll, ll>

ll n, k, m;
vll v, v2;
v2d vk;
ll ans;

void solve()
{
    cin >> n >> k >> m;
    v.resize(n, 1);
    vk.resize(k);
    for (ll i = 0; i < n; i++)
    {
        ll in;
        cin >> in;
        vk[in-1].push_back(i);
    }
    for (ll i = 0; i < m; i++)
    {
        ll c, x;
        cin >> c >> x;
        c--;
        v2 = v;
        for (ll j = 0; j < vk[c].size(); j++)
        {
            if (vk[c][j]+x >= n)
            {
               ans += v[n-1];
               v2[n-1] = 0;
            }
            else if (vk[c][j]+x < 0)
            {
                ans += v[0];
                v2[0] = 0;
            }
            else
            {
                v2[vk[c][j]+x] += v[vk[c][j]];
                v2[vk[c][j]] = v2[vk[c][j]]-v[vk[c][j]];
            }
        }
        v = v2;
    }
    cout << ans;
}
 
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    ll t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}