#include <fstream>
#include <algorithm>

using namespace std;

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

const int MOD = 666013;

int N, M, P;
int s1[505], s2[505], s3[505];
int dp[2][505][505];

int main()
{
    fin >> N >> M >> P;
    for (int i = 1; i <= N; ++i)
        fin >> s1[i];
    for (int i = 1; i <= M; ++i)
        fin >> s2[i];
    for (int i = 1; i <= P; ++i)
        fin >> s3[i];

    dp[0][0][0] = 1;
    int pos = 0;
    for (int k = 0; k <= P; ++k, pos = 1 - pos)
    {
        for (int i = 1; i <= N; ++i)
            for (int j = 1; j <= M; ++j)
                dp[pos][i][j] = 0;

        for (int i = 1; i <= N; ++i)
            for (int j = 1; j <= M; ++j)
                if (s1[i] == s2[j])
                {
                    for (int p = max(k - 1, 0); p < i; ++p)
                        if (s1[p] <= s1[i])
                        {
                            for (int q = max(k - 1, 0); q < j; ++q)
                            {
                                if (s3[k] != s1[i])
                                {
                                    dp[pos][i][j] += dp[pos][p][q];
                                    dp[pos][i][j] %= MOD;
                                }
                                else
                                {
                                    dp[pos][i][j] += dp[1 - pos][p][q];
                                    dp[pos][i][j] %= MOD;
                                }
                            }
                        }
                }
    }
    pos = 1 - pos;
    int sum = 0;
    for (int i = 1; i <= N; ++i)
        for (int j = 1; j <= M; ++j)
        {
            sum += dp[pos][i][j];
            sum %= MOD;
        }

    fout << sum << '\n';

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