#include <bits/stdc++.h>
using namespace std;
void PrintArray(const vector<int> &arr) {
  for (int i = 0; i < (int)arr.size(); i++) cout << arr[i] << " ";
  cout << endl;
}
void SieveOfEratosthenes(int n) {
  vector<bool> prime(n + 1, 0);
  prime[0] = 0;
  prime[1] = 0;
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
long long int factorial(long long int n) {
  return (n == 1 || n == 0) ? 1 : n * factorial(n - 1);
}
int main() {
  std::ios::sync_with_stdio(false);
  ;
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> p(n), s(n), c(k);
  for (int i1 = 0; i1 < n; i1++) cin >> p[i1];
  for (int i1 = 0; i1 < n; i1++) cin >> s[i1];
  for (int i1 = 0; i1 < k; i1++) cin >> c[i1];
  int cnt = 0;
  vector<int> vec;
  for (int i = 1; i <= m; i++) {
    int mx = 0, mx_indx = 0;
    for (int j = 0; j < n; j++) {
      if (s[j] == i && p[j] > mx) {
        mx = p[j];
        mx_indx = j;
      }
    }
    vec.push_back(mx_indx + 1);
  }
  sort(vec.begin(), vec.end());
  for (int i = 0; i < k; i++) {
    if (!binary_search(vec.begin(), vec.end(), c[i])) cnt++;
  }
  cout << cnt << endl;
  return 0;
}
