#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
// #pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

std::lcm(ll a, ll b), std::gcd(int a, int b)

cout << fixed << setprecision(n);

set with custom ordering
set<ll, decltype(&cmp)> qu(cmp);

*/

typedef int64_t ll;

/*

brainstorming


	// tehat
	// az, hogy minden nem-ures cella elemeit egyenkent mozgatjuk
	// mert "ugyis konvergalnak"
	// az nem mukodik
	
	// trivialis pelda N = 1e5, k = 1, m = 1e5
	// minden utasitas egy szimpla -1 (vagy +1, ugyanaz)
	// eloszor akkor N elemet kell mozgatni, N-1, N-2, etc
	// total komplexitas N^2, nem jo

	// na tehat
	// masik otlet: balrol jobbra megyunk: mikor tud egy adott elem kilepni?
	// hat, ha a tole ballra levo ki tudott lepni
	// es o a kilepes elott oda tudott jutni

	// ugyanezt jobbrol
	// es akkor igy az osszes elemre kijon, hogy kiszabadult-e

	// :cry emoji:
	// elolvastam a tag-et, binaris kereses
	// mondjuk probaljunk azert ettol elvonatkoztatni

*/

void solve() {

	ll n, k, m;
	cin >> n >> k >> m;

	vector<ll> v(n+2, 1);
	v[0] = 0;
	v[n+1] = 0;
	vector<ll> col(n+1, 0);
	vector<vector<ll>> c(k+1);
	for(ll i = 1; i <= n; i++) {
		cin >> col[i];
		c[col[i]].push_back(i);
		//cerr << "\ni=" << i << "; coli=" << col[i];
	}
	
	//cerr << "\nv=" << v;
	//cerr << "\ncol=" << col;
	//cerr << "\nc=" << c;

	// subtask 2

	for(ll mi = 0; mi < m; mi++) {
		ll ch, x;
		cin >> ch >> x;
		
		//cerr << "\nmi=" << mi;
		//cerr << "\nch=" << ch << "; x=" << x;

		vector<pair<ll,ll>> add;
		for(const auto & h : c[ch]) {
			//cerr << "\nh=" << h << "; v[h]=" << v[h];
			add.push_back({h + x, v[h]});
			v[h] = 0;
		}

		for(const auto & [ind, cnt] : add) {
			v[ind] += cnt;
		}

		//cerr << "\nv=" << v;
	}

	//cerr << "\nv=" << v;

	cout << v[0] + v[n+1];

}

int main()
{
	std::ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);

	solve();

	return 0;
}