#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <array>
#include <set>

#define ll long long;

using namespace std;

ifstream fin ("milkorder.in");
ofstream fout ("milkorder.out");

int N, M, K;

int main()
{
  fin>>N>>M>>K;
  int order[M];
  int cow[K];
  int position[K];

  for(int i = 0; i<M; i++){
    fin>>order[i];
  }

  for(int i = 0; i<K; i++){
    fin>>cow[i]>>position[i];
  }
  int ans = 1;
  for(int i = 0; i<K; i++){
    ans++;
    int end_pos = 0;
    for(int j = 0; j<M; j++){

      if(order[j]==cow[i]){
        int k;
        for(k = j-1; k>=end_pos; k--){
          ans++;
        }
        end_pos=j+1;
      }
    }
  }
  fout<<ans;

  return 0;
}