// Source: https://usaco.guide/general/io

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

#define ll  long long
#define vll  vector<long long>
#define pll pair<long long, long long>
#define fs first
#define sc second

void mozg(ll c, int x, vector<pll> v)
{
    cout<<"===="<<endl<<c<<"|"<<x<<":";
    for(ll o=1; o < v.size()-1;o++)
    {
        cout<<" -";
        if(v[o].fs==c && v[o].sc>0)
        {
            v[o].sc--;
            v[o+x].sc++;
            cout<<"ye";
        }
        cout<<endl;
    }
}

int main() {
    ll n, k, m; cin >> n >> k >> m;
    pll a{0,1};
    vector<pll> v(n+2,a);
    v[0].sc=0;
    v[0].fs=-1;
    v[n+1].sc=0;
    v[n+1].fs=-1;

    //fs:színe, sc:emberek száma
    for(ll i=1; i<n+1; i++)
    {
        cin >> v[i].fs;
    }

    /*for(ll i=0; i<n+2; i++)
    {
        cout << v[i].fs << " ";
    }
    cout<<endl;
    for(ll i=0; i<n+2; i++)
    {
        cout << v[i].sc << " ";
    }
    cout<<endl;*/

    ll c = 0;
    int x = 0;
    for(ll j=0; j<m; j++)
    {
        cin >> c >> x;
        //mozg(c,x,v);
        //cout<<"===="<<endl<<c<<"|"<<x<<":";
        for(ll o=1; o < v.size()-1;o++)
        {
            //cout<<" -";
            if(v[o].fs==c && v[o].sc>0)
            {
                v[o+x].sc+=v[o].sc;
                v[o].sc=0;
                //cout<<"ye";
            }
            //cout<<endl;
        }


        /*for(ll i=0; i<n+2; i++)
        {
            cout << v[i].fs << " ";
        }
        cout<<endl;
        for(ll i=0; i<n+2; i++)
        {
            cout << v[i].sc << " ";
        }
        cout<<endl;*/
    }
    cout << v[0].sc+v[n+1].sc;

}