#include <cstdio>
#include <algorithm>
using namespace std;

#define Nmax 510
#define MOD 666013

int n, m, p, Vmax, N, C, S;
int A[Nmax][Nmax], B[Nmax][Nmax], AQ[Nmax], BQ[Nmax];
int ASum1[Nmax], ASum2[Nmax], BSum1[Nmax], BSum2[Nmax];
int S1[Nmax], S2[Nmax], S3[Nmax];

void update_A(int poz, int val) {
    C = 0;
    while ( poz <= N ) {
        AQ[poz] += val;
        if (AQ[poz] >= MOD) AQ[poz]-= MOD;
		
		while ( !(poz & (1<<C)) ) C++;
        poz += (1<<C);
        C += 1;
    }
}

void update_B(int poz, int val) {
    C = 0;
    while ( poz <= N ) {
        BQ[poz] += val;
        if (BQ[poz] >= MOD) BQ[poz]-= MOD;
		
		while ( !(poz & (1<<C)) ) C++;
        poz += (1<<C);
        C += 1;
    }
}

int query_A(int poz) {
    
	C = 0, S = 0;
    while ( poz > 0 ) {
          S += AQ[poz];
          while ( !(poz & (1<<C)) ) C++;
          poz -= (1<<C);
          C += 1;
    }
    
    return S;
}

int query_B(int poz) {
    
	C = 0, S = 0;
    while ( poz > 0 ) {
          S += BQ[poz];
          while ( !(poz & (1<<C)) ) C++;
          poz -= (1<<C);
          C += 1;
    }
    
    return S;
}

void citire () {
	
	int i;
	
	scanf ("%d %d %d", &n, &m, &p);
	for (i = 1; i <= n; i++) {
		scanf ("%d", &S1[i]);
		if (S1[i] > Vmax) Vmax = S1[i];
	}
	
	for (i = 1; i <= m; i++) {
		scanf ("%d", &S2[i]);
		if (S2[i] > Vmax) Vmax = S2[i];
	}
	
	for (i = 1; i <= p; i++) 
		scanf ("%d", &S3[i]);
}

void dinamica () { 
	
	int i, j, k;
	
	N = Vmax;
	A[0][0] = 1;
	
	for (i = 1; i <= n; i++) {
		memset (AQ, 0, sizeof (AQ));
		
		for (j = 1; j <= m; j++) {
			if (S1[i] == S2[j]) {
				A[i][j] = query_A (S2[j]);
				if (A[i][j] >= MOD) A[i][j]-= MOD;
				
				if (A[0][0] == 1) A[i][j]++;
				if (A[i][j] >= MOD) A[i][j]-= MOD;
			}
			
			update_A (S2[j], ASum1[j]);
			
			ASum2[j] = ASum1[j] + A[i][j];			
			if (ASum2[j] >= MOD) ASum2[j]-= MOD;
		}
		
		memcpy (ASum1, ASum2, sizeof (ASum1));
	}
	
	for (k = 1; k <= p; k++) {
		
		memset (ASum1, 0, sizeof (ASum1));
		memset (BSum1, 0, sizeof (BSum1));
		
		for (i = 1; i <= n; i++) {
			memset (AQ, 0, sizeof (AQ));
			memset (BQ, 0, sizeof (BQ));
			
			for (j = 1; j <= m; j++) {
				if (S1[i] == S2[j]) {
					
					if (S1[i] == S3[k]) {
						B[i][j]+= query_A (S2[j]);
						if (B[i][j] >= MOD) B[i][j]-= MOD;
						
						if (A[0][0] == 1) B[i][j]++;
						if (B[i][j] >= MOD) B[i][j]-= MOD;
					}
					
					else {
						B[i][j]+= query_B (S2[j]);
						if (B[i][j] >= MOD) B[i][j]-= MOD;
					}
				}		
				
				update_A (S2[j], ASum1[j]);
				
				ASum2[j] = ASum1[j] + A[i][j];
				if (ASum2[j] >= MOD) ASum2[j]-= MOD;
				
				update_B (S2[j], BSum1[j]);
				
				BSum2[j] = BSum1[j] + B[i][j];
				if (BSum2[j] >= MOD) BSum2[j]-= MOD;
			}
			
			memcpy (ASum1, ASum2, sizeof (ASum1));
			memcpy (BSum1, BSum2, sizeof (BSum1));
		}
		
		for (i = 0; i <= n; i++) {
			memcpy (A[i], B[i], sizeof (A[i]));
			memset (B[i], 0, sizeof (B[i]));
		}
	}
	
	
	int sol = 0;
	for (i = 1; i <= n; i++)
		for (j = 1; j <= m; j++) {
			sol+= A[i][j];
			if (sol >= MOD) sol-= MOD;
		}
	
	printf ("%d", sol);
}

int main () {

	freopen ("pedefe.in", "r", stdin);
	freopen ("pedefe.out", "w", stdout);

	citire ();
	dinamica ();
	
	return 0;
}