#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  ;
  int n, m, k, c = 0;
  cin >> n >> m >> k;
  int P[n], S[n], K[k], AS[m];
  for (int i = 0; i < m; i++) AS[i] = -1;
  for (int i = 0; i < n; i++) cin >> P[i];
  for (int i = 0; i < n; i++) cin >> S[i];
  for (int i = 0; i < k; i++) cin >> K[i];
  for (int i = 0; i < n; i++) {
    if (AS[S[i] - 1] == -1)
      AS[S[i] - 1] = i;
    else if (P[i] > P[AS[S[i] - 1]])
      AS[S[i] - 1] = i;
  }
  for (int i = 0; i < k; i++) {
    if (AS[S[K[i] - 1] - 1] != K[i] - 1) c++;
  }
  cout << c << endl;
  return 0;
}
