#include <vector>
#include <string> 
#include <set> 
#include <map> 
#include <unordered_set>
#include <unordered_map>
#include <queue> 
#include <bitset> 
#include <stack>
#include <list>

#include <numeric> 
#include <algorithm> 
#include <random>
#include <chrono>

#include <cstdio>
#include <fstream>
#include <iostream> 
#include <sstream> 
#include <iomanip>
#include <climits>

#include <cctype>
#include <cmath> 
#include <ctime>
#include <cassert>

using namespace std;

#define ULL unsigned long long
#define LL long long
#define PII pair <int, int>
#define VB vector <bool>
#define VI vector <int>
#define VLL vector <LL>
#define VD vector <double>
#define VS vector <string>
#define VPII vector <pair <int, int> >
#define VVI vector < VI >
#define VVB vector < VB >
#define SI set < int >
#define USI unordered_set <int>
#define MII map <int, int>
#define UMII unordered_map <int, int>
#define MS multiset
#define US unordered_set
#define UM unordered_map
#define UMS unordered_multiset
#define UMM unordered_multimap

#define FORN(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)

#define SZ size()
#define BG begin() 
#define EN end() 
#define CL clear()
#define X first
#define Y second
#define RS resize
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(), x.end()
#define INS insert
#define ER erase
#define CNT count

int n, c, q;
VI color, cnt;
VVI byColor;
VPII queries;

int main()
{
	cin >> n >> c >> q;
	color.RS(n + 2);
	cnt.RS(n + 2);
	byColor.RS(c + 1);
	FOR(i, 1, n) 
	{
		cin >> color[i];
		cnt[i] = 1;
		byColor[color[i]].PB(i);
	}

	queries.RS(q + 1);
	bool allSame = true;
	FOR(i, 1, q)
	{
		cin >> queries[i].X >> queries[i].Y;
		if (i > 1) allSame &= queries[i].Y == queries[i - 1].Y;
	}

	if (!allSame)
	{
		FOR(i, 1, q)
		{
			auto [color, delta] = queries[i];
			if (delta == -1)
				for (int i : byColor[color]) 
				{
					cnt[i + delta] += cnt[i];
					cnt[i] = 0;
				}
			else
				FORD(j, byColor[color].SZ - 1, 0)
				{
					int i = byColor[color][j];
					cnt[i + delta] += cnt[i];
					cnt[i] = 0;
				}
		}
		cout << cnt[0] + cnt[n + 1];
		return 0;
	}
	else
	{
		int ans = 0, j = q;
		if (queries[1].Y == -1)
		{
			FOR(i, 1, n)
			{
				while (j >= 1 && queries[j].X != color[i]) --j;
				if (j == 0) break;
				++ans;
				--j;
			}
		}
		else
		{
			FORD(i, n, 1)
			{
				while (j >= 1 && queries[j].X != color[i]) --j;
				if (j == 0) break;
				++ans;
				--j;
			}
		}
		cout << ans;
	}

	return 0;
}