#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long fpo(long long x, long long y);
int main() {
  int n, m, k, p[105], id[105] = {}, c = 0;
  std::vector<map<int, int>> v(105);
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) {
    cin >> p[i];
  }
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    v[x].insert({p[i], i + 1});
  }
  for (int i = 0; i < k; i++) {
    int x;
    cin >> x;
    id[x] = 1;
  }
  for (int i = 0; i < 102; i++) {
    for (map<int, int>::iterator it = v[i].begin(); it != v[i].end(); it++) {
      if (id[it->second] == 1) {
        map<int, int>::iterator jt = it;
        jt++;
        if (jt != v[i].end()) c++;
      }
    }
  }
  cout << c << "\n";
  return 0;
}
long long fpo(long long x, long long y) {
  if (y == 0)
    return 1;
  else {
    long long tem = fpo(x, y / 2);
    if (y % 2 == 0)
      return (tem * tem) % mod;
    else
      return (((tem * tem) % mod) * x) % mod;
  }
}
