#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int N, K, M;
    cin >> N >> K >> M;
    
    vector<int> rooms(N + 1); // szobák színei
    unordered_map<int, vector<int>> color_positions; // színek pozíciói
    
    for (int i = 1; i <= N; i++) {
        cin >> rooms[i];
        color_positions[rooms[i]].push_back(i);
    }
    
    vector<bool> occupied(N + 2, true); // szobák foglaltsága
    int escaped = 0;
    
    while (M--) {
        int c, x;
        cin >> c >> x;
        if (color_positions.find(c) == color_positions.end()) continue;
        
        vector<int> new_positions;
        for (int pos : color_positions[c]) {
            int new_pos = pos + x;
            if (new_pos < 1 || new_pos > N || !occupied[new_pos]) {
                escaped++;
            } else {
                new_positions.push_back(new_pos);
            }
            occupied[pos] = false;
        }
        
        for (int pos : new_positions) {
            occupied[pos] = true;
        }
        color_positions[c] = new_positions;
    }
    
    cout << escaped << '\n';
    return 0;
}