#include<bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 500 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e7;
int n, p, q;
string a[maxN], b[maxN], c[maxN];
void ReadInput()
{
    cin >> n >> p >> q;
    for(int i=1; i<=n; i++)
        cin >> a[i];
    for(int i=1; i<=p; i++)
        cin >> b[i];
    for(int i=1; i<=q; i++)
        cin >> c[i];
}
void Solve()
{
    vector<vector<vector<int>>> f(n + 1, vector<vector<int>> (p + 1, vector<int> (q + 1, 0)));
    f[0][0][0] = 0;
   // cout << f[n][p][q];return;
    for(int i=1; i<=n; i++)
        for(int j=0; j<=p; j++)
            for(int k=0; k<=q; k++)
            {
                f[i][j][k] = f[i - 1][j][k];
                if(j) f[i][j][k] = max(f[i][j][k], f[i - 1][j - 1][k] + (b[j] == a[i]));
                if(k) f[i][j][k] = max(f[i][j][k], f[i - 1][j][k - 1] + (c[k] == a[i]));
            }

    int res = 0;
    for(int i=0; i<=n; i++)
        for(int j=0; j<=p; j++)
            for(int k=0; k<=q; k++)
                res = max(res, f[i][j][k]);
    cout << res;
}
#define taskname "sol"
int32_t main()
{
    if (fopen(taskname ".inp", "r"))
    {
        freopen(taskname ".inp", "r", stdin);
       // freopen(taskname ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    //cin >> T;
    for(int itest=1; itest<=T; itest++)
    {
        ReadInput();
        Solve();
    }
}