#include <bits/stdc++.h>
using namespace std;
const long long mod = (1e+9) + 7;
const long long size = 2e5 + 9;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long power(long long a, long long b, long long m = mod) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % m;
    b = b >> 1;
    a = (a * a) % m;
  }
  return res;
}
void solve() {
  long long n, m, k;
  cin >> n >> m >> k;
  vector<long long> adj[1000];
  long long p[n + 1];
  for (long long i = 1; i < n + 1; i++) cin >> p[i];
  long long s[n + 1];
  for (long long i = 1; i < n + 1; i++) {
    cin >> s[i];
    adj[s[i]].push_back(p[i]);
  }
  long long c[k + 1];
  for (long long i = 1; i < k + 1; i++) cin >> c[i];
  for (long long i = 1; i < m + 1; i++) sort(adj[i].begin(), adj[i].end());
  vector<long long> v;
  for (long long i = 1; i < m + 1; i++) {
    v.push_back(adj[i][adj[i].size() - 1]);
  }
  long long ans = 0;
  for (long long i = 1; i < k + 1; i++) {
    long long cc = 0;
    for (long long j = 0; j < v.size(); j++) {
      if (v[j] == p[c[i]]) cc = 1;
    }
    if (cc == 0) ans++;
  }
  cout << ans << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  clock_t beg = clock();
  solve();
  clock_t end = clock();
  fprintf(stderr, "%.3f sec, Copyright %c 2019 Skyscraper. \n",
          double(end - beg) / CLOCKS_PER_SEC, 184);
  return 0;
}
