#include <bits/stdc++.h>

using namespace std;

#define int long long
#define ll long long
#define forn(i, n) for (ll i = 0; i < n; ++i)
#define forr(i, s, n) for (ll i = s; i < n; ++i)
#define fori(i, s, n) for (ll i = s; i > n; --i)
#define fora(i, n) for (auto i: n)
#define vi vector<int>
#define vll vector<ll>

const int MOD = 998244353;
// const int MOD = 1e9 + 7;

int lcs(vector<int>& a, vector<int>& b) {
    int n = a.size(), m = b.size();
    vector<vector<int>> dp(n + 1, vector<int>(m + 1));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (a[i - 1] == b[j - 1]) {
                dp[i][j] = 1 + dp[i - 1][j - 1];
            } else {
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
            }
        }
    }
    return dp[n][m];
}

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vi a(n), b(m), c(k);
    forn(i, n) {
        string s;
        cin >> s;
        a[i] = (int)s[0] * 256 + s[1];
    }
    forn(i, m) {
        string s;
        cin >> s;
        b[i] = (int)s[0] * 256 + s[1];
    }
    forn(i, k) {
        string s;
        cin >> s;
        c[i] = (int)s[0] * 256 + s[1];
    }
    cout << lcs(a, b) + lcs(a, c) << endl;
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1;
    // cin >> t;
    while (t--) solve();

    return 0;
}