#include <fstream>
#include <cmath>
#include <algorithm>
using namespace std;
 
#define MAX 105
 
ifstream f("nextseq.in");
ofstream g("nextseq.out");
 
int N,M,P,i,j,nr;
short A[MAX],B[MAX],X[MAX],Y[MAX];
 
int main()
{
    f >> N >> M >> P;
    A[0] = M, B[0] = P;
 
    for (i = 0; i < N; i++)
        f >> X[i];
    for (i = 0; i < M; i++)
        f >> A[M - i];
    for (i = 0; i < P; i++)
        f >> B[P - i];
 
    sort( X , X + N );
 
    for (i = 0; i < N; i++)
        Y[X[i]] = i ;
    for (i = 1; i <= M; i++)
        A[i] = Y[A[i]];;
    for (i = 1; i <= P; i++)
        B[i] = Y[B[i]];
 
    bool stop = 1, res;
 
    while ( stop )
    {
        stop = 0;
        res = 0;
        for (i = 1; i <= A[0] ; i++)
        {
            if ( A[i] != B[i] ) stop = 1;
            if ( A[i] < N - 1 && !res )
            {
                res = 1, A[i]++;
                for (j = i - 1; j > 0 ; j--) A[j] = 0;
            }
        }
        if ( !res )
        {
            A[0]++;
            for (i = 1; i < A[0]; i++) A[i] = 0;
        }
        nr++;
        if (A[0] != B[0])  stop = 1;
    }
    g << --(--nr);
 
 
    return 0;
}