#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int P[110];
int M[110];
int Best[110];
int Speshial[110];
int main(void) {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) cin >> P[i];
  for (int i = 1; i <= n; i++) cin >> M[i];
  for (int i = 1; i <= k; i++) cin >> Speshial[i];
  for (int i = 1; i <= n; i++) Best[i] = -1;
  for (int i = 1; i <= n; i++) Best[M[i]] = max(Best[M[i]], P[i]);
  int res = 0;
  for (int i = 1; i <= k; i++) {
    if (P[Speshial[i]] == Best[M[Speshial[i]]]) continue;
    res++;
  }
  cout << res << "\n";
  return 0;
}
