#include <iostream>
#include <vector>
#include <unordered_map>

using namespace std;

int main() {
    int N, K, M;
    cin >> N >> K >> M;
    
    vector<int> rooms(N);
    unordered_map<int, vector<int>> color_positions;
    
    for (int i = 0; i < N; i++) {
        cin >> rooms[i];
        color_positions[rooms[i]].push_back(i);
    }
    
    int exited = 0;
    
    for (int i = 0; i < M; i++) {
        int c, x;
        cin >> c >> x;
        
        vector<int> new_positions;
        for (int pos : color_positions[c]) {
            int new_pos = pos + x;
            if (new_pos < 0 || new_pos >= N) {
                exited++;
            } else {
                new_positions.push_back(new_pos);
            }
        }
        
        color_positions[c] = new_positions;
    }
    
    cout << exited << "\n";
    
    return 0;
}