using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <cctype>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <iomanip>
#include <fstream>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define oo 1<<30
#define f first
#define s second
#define II inline
#define db double
#define ll long long
#define pb push_back
#define mp make_pair
#define Size(V) ((int)(V.size()))
#define all(v) v.begin() , v.end()
#define CC(v) memset((v),0,sizeof((v)))
#define CP(v,w) memcpy((v),(w),sizeof((w)))
#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);++(i))
#define REP(i, N) for (int (i)=0;(i)<(int)(N);++(i))
#define FORit(it, x) for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); ++it)

#define IN "pedefe.in"
#define OUT "pedefe.out"
#define N_MAX (1<<9)
#define Mod (666013)
#define bit(x) ((x)&(x-1))^(x)
#define add_mod(x) ( (x) > Mod ? (x) - Mod : (x) )

typedef vector<int> VI;
typedef pair<int,int> pi;
typedef vector<string> VS;
template<class T> string toString(T n) {ostringstream ost;ost<<n;ost.flush();return ost.str();}

int X,Y,Z,S1[N_MAX],S2[N_MAX],S3[N_MAX];
int C[2][N_MAX][N_MAX],Aib[N_MAX][N_MAX];
vector<pi> Q;

II void scan()
{
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	
	scanf("%d%d%d",&X,&Y,&Z);
	FOR(i,1,X) scanf("%d",S1+i);
	FOR(i,1,Y) scanf("%d",S2+i);
	FOR(i,1,Z) scanf("%d",S3+i);
}

II void update(int x,int y,int val)
{
	for(int i = x;i <= N_MAX;i += bit(i) )
	for(int j = y;j <= N_MAX;j += bit(j) )
		Aib[i][j] = add_mod(Aib[i][j] + val);
}

II int query(int x,int y)
{
	if(!x || !y)
		return 0;
	int sum = 0;
	for(int i = x;i >= 1;i -= bit(i) )
	for(int j = y;j >= 1;j -= bit(j) )
		sum = add_mod(sum + Aib[i][j]);
	return sum;
}

II bool comp(const pi x,const pi y)
{
	return S1[x.f] < S1[y.f];
}

II void solve()
{
	int A(0),B(1);
	
	FOR(j1,1,X)
	FOR(j2,1,Y)
		if(S1[j1] == S2[j2])
			Q.pb( mp(j1,j2) );
	sort(Q.begin(),Q.end(),comp);
	S3[Z+1] = 501;
	
	FOR(i,1,Z)
	{
		A ^= 1;
		B ^= 1;
		CC(C[A]);
		
		FORit(it,Q)
		{
			int j1 = it->f;
			int j2 = it->s;
			
			if(S1[j1] == S2[j2] && S1[j1] == S3[i])
				C[A][j1][j2] += C[B][j1-1][j2-1] + (i == 1);
		}
		
		//printf("pt %d - fara suma\n",i);
		//FOR(j1,1,X)
		//{
		//	FOR(j2,1,Y)
		//		printf("%d ",C[A][j1][j2]);
		//	printf("\n");
		//}	printf("\n");
		
		CC(Aib);
		FORit(it,Q)
		{
			int j1 = it->f;
			int j2 = it->s;
			if(S1[j1] < S3[i] || S1[j1] > S3[i+1])
				continue;
			
			C[A][j1][j2] += query(j1 - 1,j2 - 1);
			update(j1,j2,C[A][j1][j2]);
		}
		
		//printf("pt %d - final\n",i);
		//FOR(j1,1,X)
		//{
		//	FOR(j2,1,Y)
		//		printf("%d ",C[A][j1][j2]);
		//	printf("\n");
		//}	printf("\n");
		
		FOR(j1,1,X)
		FOR(j2,1,Y)
			C[A][j1][j2] = (C[A][j1][j2] + C[A][j1-1][j2] + C[A][j1][j2-1] - C[A][j1-1][j2-1]) % Mod;
	}
	
	printf("%d\n",C[A][X][Y]);
}

int main()
{
	scan();
	solve();
	return 0;
}