#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define fs first
#define sc second
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, ll> pll;
typedef priority_queue <ll, vector<ll>, greater<ll>> pqmin;
const double EPS = 1e-16;
const int INF = 2e9;
const int MOD = 1e9+7;

const int p=505;
int dp[p][p][p];
string s1[p];
string s2[p];
string s3[p];

void solve(){
    int n,m1,m2;
    cin>>n>>m1>>m2;
    for(int i=1;i<=n;i++){
        cin>>s1[i];
    }
    for(int i=1;i<=m1;i++){
        cin>>s2[i];
    }
    for(int i=1;i<=m2;i++){
        cin>>s3[i];
    }
    for(int i=0;i<=n;i++){
        for(int j=0;j<=m1;j++){
            for(int k=0;k<=m2;k++){
                if(i!=0){
                    dp[i][j][k]=max(dp[i][j][k],dp[i-1][j][k]);
                }
                if(j!=0){
                    dp[i][j][k]=max(dp[i][j][k],dp[i][j-1][k]);
                    if(s1[i]==s2[j]){
                        dp[i][j][k]=max(dp[i][j][k],dp[i-1][j-1][k]+1);
                    }
                }
                if(k!=0){
                    dp[i][j][k]=max(dp[i][j][k],dp[i][j][k-1]);
                    if(s1[i]==s3[k]){
                        dp[i][j][k]=max(dp[i][j][k],dp[i-1][j][k-1]+1);
                    }
                }
            }
        }
    }
    cout<<dp[n][m1][m2]<<endl;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t=1;

    while(t--){
        solve();
    }

    cin.get();
    return 0;
}