#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("nextseq.in");
ofstream g("nextseq.out");
int i,n,m,k,r,s,maxi,t,p,x[10001],s1[10001],s2[10001],a[10001],b[10001],c[10001],v[100001];
int main()
{f>>n>>p>>m;
for(i=1;i<=n;++i)
{f>>a[i];
v[a[i]]++;
maxi=max(maxi,a[i]);
}
for(i=0;i<=maxi;++i)
	if(v[i])
	{++k;
	x[i]=k;
	}
s1[0]=p;
s2[0]=m;
for(i=p;i>=1;--i)
{f>>b[i];
s1[i]=x[b[i]];
}
for(i=m;i>=1;--i)
{f>>c[i];
s2[i]=x[c[i]];
}
for(i=1;i<=s2[0];++i)
	if(s2[i]<s1[i]+t)
	{s2[i]=s2[i]+n-s1[i]-t;
	t=1;
	}
	else
	{s2[i]-=s1[i]+t;
	t=0;
	}
for(;s2[0]>1&&!s2[s2[0]];--s2[0]);

r=1;
for(i=1;i<=s2[0];++i)
{s+=s2[i]*r;
r*=n;
}
if(s==0)
	g<<0;
else
	g<<s-1;
g<<'\n';
return 0;
}