#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,m,r;
    cin>>n>>m>>r;
    int sum=n,mc,min=r;
    int v[n]={};
    int f1[n],p1[n],f2[n],p2[n],l;
    for(int i=1;i<=n;i++)cin>>f1[i-1];
    for(int j=1;j<=n;j++)cin>>p1[j-1];
    for(int o=1;o<=n;o++)cin>>f2[o-1];
    for(int p=1;p<=n;p++)cin>>p2[p-1];
    for(int t=1;t<=n;t++)
    {
        int g;
        cin>>l;
        for(g=0;g<n;g++)
        {
            if(f2[g]==f1[l-1]&p2[g]>p1[l-1]&v[g]!=1)
            {
                if(p2[g]<=min)
                { 
                    min=p2[g];
                    mc=g;
                }
            }
        }
        if(min!=r)
        {
            sum--;
            v[mc]=1;
        }
        min=r;
    }
    cout<<sum;
    return 0;