#include <fstream>
#include <iostream>
#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 MAXN  505
#define modulo 666013

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

int Cnt[2][MAXN][MAXN];

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;

	Cnt[s][0][0] = 1;

	FOR (i, 1, n) FOR (j, 1, m) 
		if (A[i] == B[j]) 
		{
			FOR (p, 0, i-1) FOR (q, 0, j-1) 
				if (A[p] == B[q] && A[p] <= A[i])
					Cnt[s][i][j] += Cnt[s][p][q];
		}

	FOR (k, 1, p) 
	{
		s = k & 1;
		memset(Cnt[s], 0, sizeof(Cnt[s]));
		
		FOR (i, 1, n) FOR (j, 1, m) if (A[i] == B[j]) 
		{
			if (A[i] == C[k]) 
			{
				FOR (p, 0, i-1) FOR (q, 0, j-1) 
					if (A[p] == B[q] && A[p] <= A[i])
						Cnt[s][i][j] += Cnt[s ^ 1][p][q];
			} else {
				FOR (p, 1, i-1) FOR (q, 1, j-1) 
					if (A[p] == B[q] && A[p] <= A[i])
						Cnt[s][i][j] += Cnt[s][p][q];
			}
		}
	}

	int ret = 0;

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

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

	fout.close();

	return 0;
}