#include <bits/stdc++.h>
using namespace std;
int32_t main() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> p(n);
  for (int i = 0; i < n; ++i) cin >> p[i];
  vector<int> s(n);
  for (int i = 0; i < n; ++i) cin >> s[i];
  vector<int> c(k);
  for (int i = 0; i < k; ++i) cin >> c[i];
  vector<vector<int>> schools(m + 1, vector<int>());
  for (int i = 0; i < n; ++i) {
    schools[s[i]].push_back(p[i]);
  }
  int ans = 0;
  for (int i = 0; i < k; ++i) {
    int cur = c[i];
    int school = s[cur - 1];
    int power = p[cur - 1];
    vector<int> ss = schools[school];
    sort(ss.rbegin(), ss.rend());
    if (ss[0] != power) ans++;
  }
  cout << ans << endl;
  return 0;
}
