#include <bits/stdc++.h>
using namespace std;
const long double PI = 2 * acos(0.0);
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m, k;
  cin >> n >> m >> k;
  int p[n + 2], s[n + 2], id[k + 2];
  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 >> id[i];
  vector<pair<long long, long long>> vec;
  for (int i = 1; i <= k; i++) {
    vec.push_back(make_pair(p[id[i]], id[i]));
  }
  sort(vec.begin(), vec.end());
  for (int i = 1; i <= k; i++) {
    id[i] = vec[i - 1].second;
  }
  int arr[m + 1][n + 1];
  for (int i = 0; i < m + 1; i++) {
    for (int j = 0; j < n + 1; j++) arr[i][j] = 0;
  }
  for (int i = 1; i <= n; i++) {
    arr[s[i]][p[i]]++;
  }
  int ans = 0;
  for (int i = 1; i <= k; i++) {
    int max_power = 0;
    for (int j = 1; j <= n; j++) {
      if (arr[s[id[i]]][j] > 0 && max_power < j) max_power = j;
    }
    if (max_power != p[id[i]]) ans++;
    arr[s[id[i]]][p[id[i]]]--;
  }
  cout << ans;
  return 0;
}
