#include <bits/stdc++.h>
using namespace std;
int main() {
  int n = 0, m = 0, k = 0, i = 0, ch = 0;
  cin >> n >> m >> k;
  int strong[m];
  int force[n];
  int school[n];
  for (i = 0; i < m; i++) strong[i] = -1;
  for (i = 0; i < n; i++) cin >> force[i];
  for (i = 0; i < n; i++) {
    cin >> school[i];
    school[i]--;
  }
  for (i = 0; i < n; i++) {
    if (strong[school[i]] == -1)
      strong[school[i]] = i;
    else {
      if (force[strong[school[i]]] < force[i]) strong[school[i]] = i;
    }
  }
  set<int> si;
  for (i = 0; i < m; i++) {
    si.insert(strong[i]);
  }
  int res = 0;
  for (i = 0; i < k; i++) {
    cin >> ch;
    if (si.find(ch - 1) == si.end()) res++;
  }
  cout << res << endl;
  return 0;
}
