#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;
VPII queries;
int main()
{
cin >> n >> c >> q;
color.RS(n + 2);
FOR(i, 1, n) cin >> color[i];
queries.RS(q + 1);
FOR(i, 1, q) cin >> queries[i].X >> queries[i].Y;
int leftOut = 0, rightOut = 0;
FORD(i, q, 1)
{
if (queries[i].X == color[leftOut] && queries[i].Y == 1) --leftOut;
if (queries[i].X == color[leftOut + 1] && queries[i].Y == -1) ++leftOut;
}
FORD(i, q, 1)
{
if (queries[i].X == color[n + 1 - rightOut] && queries[i].Y == -1) --rightOut;
if (queries[i].X == color[n - rightOut] && queries[i].Y == 1) ++rightOut;
}
cout << leftOut + rightOut << endl;
return 0;
}