#include <cstdio>
#include <algorithm>

#define NMAX 10007

using namespace std;

int n, m, p;
int a[NMAX], B[NMAX], C[NMAX];
int Ap[NMAX];

void next_vertex(int a[NMAX]){
    ++a[1];
    for(int i = 1; i <= a[0]; ++i)
        if(a[i] == n + 1){
            a[i] %= n;
            ++a[i + 1];
            if(i == a[0])
                ++a[0];
        }
}

int main(){
    freopen("nextseq.in", "r", stdin);
    freopen("nextseq.out", "w", stdout);
    scanf("%d %d %d", &n, &m, &p);
    for(int i = 1; i <= n; ++i)
        scanf("%d", &a[i]);
    sort(a + 1, a + n + 1);
    for(int i = 1; i <= n; ++i)
        Ap[a[i]] = i;
    for(int j = 1; j <= m; ++j){
        scanf("%d", &B[j]);
        B[j] = Ap[B[j]];
    }
    for(int i = 1; i <= p; ++i){
        scanf("%d", &C[i]);
        C[i] = Ap[C[i]];
    }
    B[0] = m;
    C[0] = p;
    int Ans = 0;
    reverse(B + 1, B + B[0] + 1);
    reverse(C + 1, C + C[0] + 1);
    while(1){
        bool ok = true;
        if(B[0] != C[0])
            ok = false;
        if(B[0] == C[0])
            for(int i = 1; i <= B[0]; ++i)
                if(B[i] != C[i]){
                    ok = false;
                    break;
                }
        if(ok == true)
            break;
        next_vertex(B);
        ++Ans;
    }
    printf("%d", Ans - 1);
    return 0;
}