#include <cstring>
#include <fstream>
#include <algorithm>

using namespace std;

const int MOD = 666013;

int N, M, P;
int A[502], B[502], C[102];
int D[2][502][502];
int V[2][502], S[2][502];

void update(int AIB[], int pos, int val)
{
    ++pos;
    for (; pos <= 501; pos += pos & -pos)
    {
        AIB[pos] += val;
        if (AIB[pos] >= MOD) AIB[pos] -= MOD;
    }
}
int query(int AIB[], int pos)
{
    ++pos;

    int sum = 0;
    for (; pos >= 1; pos -= pos & -pos)
    {
        sum += AIB[pos];
        if (sum >= MOD) sum -= MOD;
    }
    return sum;
}

int main()
{
    ifstream fin("pedefe.in");
    ofstream fout("pedefe.out");

    fin >> N >> M >> P;
    for (int i = 1; i <= N; ++i)
        fin >> A[i];
    for (int i = 1; i <= M; ++i)
        fin >> B[i];
    for (int i = 1; i <= P; ++i)
        fin >> C[i];

    int act = 0;

    D[act][0][0] = 1;
    for (int k = 0; k <= P; ++k)
    {
        if (k != 0) act = !act;

        memset(S, 0, sizeof(S));
        for (int i = 1; i <= N; ++i)
        {
            memset(V, 0, sizeof(V));
            if (k == 0) update(V[0], 0, 1);
            else if (k == 1) update(V[1], 0, 1);

            for (int j = 1; j <= M; ++j)
            {
                if (A[i] == B[j])
                {
                    if (k != 0 && A[i] == C[k])
                        D[act][i][j] = query(V[1], B[j]);
                    else
                        D[act][i][j] = query(V[0], B[j]);
                }
                else
                    D[act][i][j] = 0;
                update(V[0], B[j], S[0][j]);
                update(V[1], B[j], S[1][j]);

                S[0][j] += D[act][i][j];
                S[1][j] += D[!act][i][j];

                if (S[0][j] >= MOD) S[0][j] -= MOD;
                if (S[1][j] >= MOD) S[1][j] -= MOD;
            }
        }
    }

    int result = 0;
    for (int i = 1; i <= N; ++i)
        for (int j = 1; j <= M; ++j)
        {
            result += D[act][i][j];
            if (result >= MOD) result -= MOD;
        }
    fout << result << '\n';

    fin.close();
    fout.close();
}