#include <bits/stdc++.h>
using namespace std;
int a[105];
vector<pair<int, int>> g[105];
int mp[105];
int c[105];
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  int id;
  for (int i = 1; i <= n; i++) {
    cin >> id;
    mp[i] = id;
    g[id].push_back(make_pair(a[i], i));
  }
  for (int i = 1; i <= k; i++) cin >> c[i];
  for (int i = 1; i <= m; i++)
    sort(g[i].begin(), g[i].end(), greater<pair<int, int>>());
  int ans = 0;
  for (int i = 1; i <= k; i++) {
    if (a[c[i]] != g[mp[c[i]]][0].first) ans++;
  }
  cout << ans << endl;
  return 0;
}
