#include <bits/stdc++.h>
using namespace std;
const int N_MAX = 108;
int P[N_MAX];
int S[N_MAX];
int K[N_MAX];
int M[N_MAX];
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) cin >> P[i];
  for (int i = 1; i <= n; i++) cin >> S[i];
  for (int i = 1; i <= k; i++) cin >> K[i];
  for (int i = 1; i <= m; i++) M[i] == 0;
  for (int i = 1; i <= n; i++) {
    M[S[i]] = max(M[S[i]], P[i]);
  }
  int ans = 0;
  for (int i = 1; i <= k; i++) {
    if (P[K[i]] < M[S[K[i]]]) ans++;
  }
  cout << ans << endl;
  return 0;
}
