#include <bits/stdc++.h>  
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
 
int main()
{
    //ifstream cin("in.txt");
    int n, k, m;
    cin >> n >> k >> m;
    vector<int> roomColors(n + 2);
    for(int i = 1; i <= n; i++){
        cin >> roomColors[i];
    }
    vector<pair<int, int>> orders(m + 1);
    for(int i = m; i >= 1; i--){
        cin >> orders[i].first >> orders[i].second;
    }
    int l = 0, r = n + 1;
    for(int i = 1; i <= m; i++){
        if(orders[i].second == -1){ 
            if(roomColors[l + 1] == orders[i].first){
                l++;
            }
            if(roomColors[r] == orders[i].first){
                r++;
            }
        }

        if(orders[i].second == 1){ 
            if(roomColors[l] == orders[i].first){
                l--;
            }
            if(roomColors[r - 1] == orders[i].first){
                r--;
            }
        }
    }

    cout << l + n - r + 1;



    return 0;
}