// Fabio Pettenuzzo VR363044 esercizio 3 maxCommonSubsequence3

#include <cassert>
#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

const int MAX_N = 100;
int M[MAX_N+1][MAX_N+1][MAX_N+1];
char s1[MAX_N+1] ;
char s2[MAX_N+1];
char s3[MAX_N+1];
int n1,n2,n3;

void print(){

cout<<endl<<"  ";
	for(int j=0;j<=n2;j++) cout << s2[j];
cout<<endl;

	for(int i=1;i<=n1+1;i++){
		cout<<s1[i]<<" ";
		for(int j=1;j<=n2+1;j++) {

			for(int k=1;k<=n2+1;k++)cout << M[i][j][k];
					cout<<endl;		cout<<endl;
			}
		cout<<endl;
	}
}

int mymax(int a, int b, int c, int d, int e, int f){
	return max(max(max(a,b),max(c,d)),max(e,f));
}


int main(){
	ifstream fin("input0.txt");
	assert(fin);
	fin>>n1>>n2>>n3;
	for(int i=1;i<=n1;i++) fin >> s1[i];
	for(int j=1;j<=n2;j++) fin >> s2[j];
	for(int k=1;k<=n2;k++) fin >> s3[k];
//cout<<endl;
	for(int i=1;i<=n3;i++) cout << s3[i];

	//for(int i=0;i<=n1;i++) M[i][n1]=0;
	//print();
	ofstream fout("output.txt");
	
	for(int i=n1;i>0;i--){
		for(int j=n2;j>0;j--) {
			for(int k=n3;k>0;k--){
				if(s1[i]!=s2[j] | s1[i]!=s3[k] | s2[j]!=s3[k]) M[i][j][k]= mymax( 
// 3 i 4 i+1
// 3 j 4 j+1
											M[i+1][j][k],
											M[i+1][j+1][k],
											M[i][j+1][k],
											M[i][j+1][k+1],
											M[i][j][k+1],
											M[i+1][j][k+1]//,

											//M[i+1][j+1][k+1]
											);
				else {
cout<<"s1["<<i<<"]"<<"=="<<"s2["<<j<<"]"<<"=="<<"s3["<<k<<"]"<<endl;
					M[i][j][k]=1+M[i+1][j+1][k+1];
					}

	//if(s1[i]!=s2[j] | s1[i]!=s3[k] | s2[j]!=s3[k])
				}
			}
	}
	cout<<endl<< M[1][1][1]+1<<endl;
	fout<<endl<< M[1][1][1]+1<<endl;
	//print();
	fout.close();
}