#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
int p[maxn], s[maxn], c[maxn];
vector<int> stus[maxn];
int cmp(int x, int y) { return x > y; }
int main() {
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &p[i]);
  for (int i = 1; i <= n; i++) scanf("%d", &s[i]);
  for (int i = 1; i <= k; i++) scanf("%d", &c[i]);
  for (int i = 1; i <= n; i++) stus[s[i]].push_back(p[i]);
  int sum = 0;
  for (int i = 1; i <= k; i++) {
    int tmp = c[i], flag = 0;
    sort(stus[s[tmp]].begin(), stus[s[tmp]].end(), cmp);
    for (int j = 0; j < stus[s[tmp]].size(); j++) {
      if (stus[s[tmp]][j] != p[tmp]) {
        flag = 1;
      } else
        break;
    }
    sum += flag;
  }
  printf("%d\n", sum);
  return 0;
}
