#include <fstream>
#include <algorithm>

using namespace std;

const char iname[] = "pedefe.in";
const char oname[] = "pedefe.out";

#define FOR(i, a, b)  for (int i = (a); i <= (b); ++ i)
#define FORR(i, b, a) for (int i = (b); i >= (a); -- i)
#define FORi(i, G)    for (vector <int>::iterator i = G.begin(); i != G.end(); ++ i)
#define ALL(X) (X).begin(), (X).end()
#define lastbit(x) ((x) ^ ((x) & ((x) - 1)))

#define MAXN	  505
#define MAXVALUE  505

#define modulo 666013

int A[MAXN], B[MAXN], C[MAXN];

int Cnt[2][MAXN][MAXN], Sum[2][MAXN][MAXN], SumV[2][MAXVALUE][MAXN], tSum[MAXN + 1];


inline void update(int &var, int val) {
	if (val < 0)
		val += modulo;
	else if (val >= modulo)
		val -= modulo;
	if ((var += val) >= modulo)
		var -= modulo;
}

int query(int M[][MAXN], int i, int j) 
{
	int ret = 0;
	for (; i > 0; i -= lastbit(i))
		if ((ret += M[i][j]) >= modulo)
			ret -= modulo;
	return ret;
}

void update(int M[][MAXN], int i, int n, int j, int val) 
{
	for (; i < MAXVALUE; i += lastbit(i))
		if ((M[i][j] += val) >= modulo)
			M[i][j] -= modulo;
}

int main(void)
{
	ifstream fin(iname);

	int n, m, p;

	fin >> n >> m >> p;
	FOR (i, 1, n) 
		fin >> A[i];
	FOR (i, 1, m) 
		fin >> B[i];
	FOR (i, 1, p) 
		fin >> C[i];

	fin.close();

	int s = 0;
	
	FOR (i, 1, n)
	{
		FOR (j, 1, m)
			Sum[s][i][j] = query(SumV[s], A[i], j);

		FOR (j, 1, m) if (A[i] == B[j])
		{
			Cnt[s][i][j] = 1;
			update(Cnt[s][i][j], Sum[s][i][1] - Sum[s][i][j]);
		}
		
		memset(tSum, 0, sizeof(tSum));
		FORR (j, m, 1)
			update(tSum[j], Cnt[s][i][j] + tSum[j + 1]);
		FORR (j, m, 1)
			update(SumV[s], A[i], n, j, tSum[j]);
	}

	FOR (k, 1, p) 
	{
		s = k & 1;
		memset(Cnt[s], 0, sizeof(Cnt[s])), memset(Sum[s], 0, sizeof(Sum[s])), memset(SumV[s], 0, sizeof(SumV[s]));
		
		FOR (i, 1, n)
		{
			FOR (j, 1, m)
				Sum[s][i][j] = query(SumV[s], A[i], j);

			FOR (j, 1, m) if (A[i] == B[j]) 
			{
				if (A[i] == C[k])
				{
					if (k == 1)
						Cnt[s][i][j] = 1;
					update(Cnt[s][i][j], Sum[s ^ 1][i][1] - Sum[s ^ 1][i][j]);
				} 
				else
					update(Cnt[s][i][j], Sum[s][i][1] - Sum[s][i][j]);
			}

			memset(tSum, 0, sizeof(tSum));
			FORR (j, m, 1)
				update(tSum[j], Cnt[s][i][j] + tSum[j + 1]);
			FORR (j, m, 1)
				update(SumV[s], A[i], n, j, tSum[j]);
		}
	}

	int ret = 0;

	FOR (i, 1, n) FOR (j, 1, m) if (A[i] == B[j]) 
		update(ret, Cnt[p & 1][i][j]);

	ofstream fout(oname);	fout << ret <<'\n';  fout.close();

	return 0;
}