#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int INF = 1e9;
const int MAX = 1 << 9;

void upd(int& x, int val) {
	x = max(x, val);
}

int dp[MAX][MAX], ndp[MAX][MAX];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, p, q;
	cin >> n >> p >> q;
	vector<string> x(n), p1(p), p2(q);
	for (string& xi : x) {
		cin >> xi;
	}
	for (string& pi : p1) {
		cin >> pi;
	}
	for (string& pi : p2) {
		cin >> pi;
	}
	FOR(i, 0, MAX) {
		FOR(j, 0, MAX) {
			dp[i][j] = ndp[i][j] = -INF;
		}
	}
	dp[0][0] = ndp[0][0] = 0;
	FOR(i, 0, n) {
		FOR(j, 0, p + 1) {
			FOR(k, 0, q + 1) {
				upd(ndp[j][k], dp[j][k]);
				if (j < p) {
					if (x[i] == p1[j]) {
						upd(ndp[j + 1][k], dp[j][k] + 1);
					}
					upd(dp[j + 1][k], dp[j][k]);
				}
				if (k < q) {
					if (x[i] == p2[k]) {
						upd(ndp[j][k + 1], dp[j][k] + 1);
					}
					upd(dp[j][k + 1], dp[j][k]);
				}
			}
		}
		memcpy(dp, ndp, sizeof dp);
	}
	cout << dp[p][q] << "\n";
	return 0;
}