#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200;
int arr[MAXN];
int top[MAXN];
int f[MAXN];
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
  }
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    f[i] = x;
    top[x] = max(top[x], arr[i]);
  }
  int ans = 0;
  for (int i = 1; i <= k; i++) {
    int x;
    cin >> x;
    if (arr[x] != top[f[x]]) ans++;
  }
  cout << ans << endl;
  return 0;
}
