#include<stdio.h>
#include<algorithm>

using namespace std;

const int maxn = 10000;


typedef int lnum[10000];

lnum a,b;
lnum sol;
int i;
int j;
int n2;
int n;
lnum s;

int n1;
int x;
int ans;
int nr[maxn];


void scadere(lnum &dest,lnum &a,lnum &b)
{
        int i;
        int t=0;
        for(i=1;i<=a[0];i++)
        {
                dest[i]=t;
                t=0;
                dest[i]=a[i]-b[i];
                if (dest[i]<0)
                {
                        t=-1;
                        dest[i]+=n+1;
                }
        }
        dest[0]=a[0];
        while(dest[dest[0]]==0) dest[0]--;
}

void ad(lnum &dest,lnum &a, lnum &b)
{
        int t=0;
        int i;
        
        for(i=1;i<=a[0]||t;i++)
        {

                dest[i]=a[i]+b[i]+t;
                t=dest[i];
                dest[i]%=n;
                t/=n;
                
        }
        dest[0]=i-1;
}
bool cmpf(lnum &a,lnum b)
{
        if (a[0]!=b[0]) return false;
        for(i=1;i<=a[0];i++)
                if (a[i]!=b[i])  return false;
        return true;

}


int main()
{
        freopen("nextseq.in","r",stdin);
        freopen("nextseq.out","w",stdout);
        scanf("%d %d %d",&n,&n1,&n2);
        for(i=1;i<=n;i++)
        {
                scanf("%d",&a[i]);
        }
        sort(a+1,a+n+1);
        for(i=1;i<=n;i++)
        {
                nr[a[i]]=i-1;
        }
        memset(a,0,sizeof(a));
        a[0]=n1;
        for(i=1;i<=n1;i++)
        {
                scanf("%d",&x);
                a[n1-i+1]=nr[x];
        }
        b[0]=n2;
        for(i=1;i<=n2;i++)
        {
                scanf("%d",&x);
                b[n2-i+1]=nr[x];
        }
        for(i=n1+1;i<=n2;i++)
        {
                a[i]=-1;
        }
        s[0]=1;
        s[1]=1;
        while(cmpf(a,b)==false)
        {

                ad(a,a,s);
                ans++;
        }
        printf("%d",ans-1);
        printf("\n");
        return 0;
}