Problem: In mathematics, a subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements. For example, the sequence BDF is a subsequence of ABCDEF. A substring of a string is a continuous subsequence of the string. For example, BCD is a substring of ABCDEF.

You are given two strings s1, s2 and another string called virus. Your task is to find the longest common subsequence of s1 and s2, such that it doesn't contain virus as a substring.

Input

The input contains three strings in three separate lines: s1, s2 and virus (1 ≤ |s1|, |s2|, |virus| ≤ 100). Each string consists only of uppercase English letters.

Output

Output the longest common subsequence of s1 and s2 without virus as a substring. If there are multiple answers, any of them will be accepted. 

If there is no valid common subsequence, output 0.

Examples

Input

AJKEQSLOBSROFGZ
OVGURWZLWVLUXTH
OZ


Output

ORZ


Input

AA
A
A


Output

0

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collection;
import java.util.Locale;
import java.util.StringTokenizer;

public class Main {
	public static void main(String[] args) throws IOException {
		new Main().run();
	}

	void run() throws IOException {
		in = new BufferedReader(new InputStreamReader(System.in));
//		in = new BufferedReader(new FileReader("input.txt"));
		
		out = new PrintWriter(System.out);
//		out = new PrintWriter(new FileWriter("output.txt"));

		Object o = solve();
		if (o != null)
			out.println(o);
		out.close();
		in.close();
	}

	String s1 ;
	String s2 ;
	String virus ;
	
	private Object solve() throws IOException {
		s1= in.readLine();
		s2 = in.readLine();
		virus = in.readLine();
		
		int n1= s1.length();
		int n2= s2.length();
		int m= virus.length();
		
		int[][] f = failure(virus);
		
		String[][][] dp = new String[n1+1][n2+1][m];
		dp[0][0][0]="";
		for(int i =0;i<=n1;i++)
			for(int j =0;j<=n2;j++)
				for(int k =0;k<m;k++)
					if(dp[i][j][k]!=null){
						if(i<n1)
							dp[i+1][j][k]=max(dp[i+1][j][k], dp[i][j][k]);
						if(j<n2)
							dp[i][j+1][k]=max(dp[i][j+1][k], dp[i][j][k]);
						if(i<n1 && j<n2 && s1.charAt(i)== s2.charAt(j)){
							char c = s1.charAt(i);
							int next = f[k][c-'A'];
							if(next<m)
								dp[i+1][j+1][next]=max(dp[i+1][j+1][next], dp[i][j][k] + ""+ c);
						}
							
						
				}
		String ret ="";
		for(int k =0;k<m;k++)
			ret = max(ret, dp[n1][n2][k]);
		
		if(ret.length()==0)
			return 0;
		return ret;
	}


	private String max(String a, String b) {
		if(a==null)
			return b;
		if(b==null)
			return a;
		if(a.length() > b.length())
			return a;
		return b;
	}

	private int[][] failure(String virus) {
		int m = virus.length();
		int[] f = new int[m+1];
		for(int i =2;i<=m;i++){
			int suff = f[i-1];
			while(true){
				if(virus.charAt(suff)==virus.charAt(i-1)){
					f[i]=suff+1;
					break;
				}else if(suff!=0){
					suff=f[suff];
				}else{
					break;
				}
			}
		}
		int[][] ret = new int[m][26];
		for(int len =0;len< m;len++)
			for(int c =0; c < 26;c++){
				int suff = len;
				while(true){
					if(virus.charAt(suff)==c+'A'){
						ret[len][c]=suff+1;
						break;
					}else if(suff!=0){
						suff=f[suff];
					}else{
						break;
					}
					
				}
			}
		return ret;
	}
	BufferedReader in;
	PrintWriter out;
	StringTokenizer strTok = new StringTokenizer("");

	String nextToken() throws IOException {
		while (!strTok.hasMoreTokens())
			strTok = new StringTokenizer(in.readLine());
		return strTok.nextToken();
	}

	int ni() throws IOException {
		return Integer.parseInt(nextToken());
	}

	long nl() throws IOException {
		return Long.parseLong(nextToken());
	}

	double nd() throws IOException {
		return Double.parseDouble(nextToken());
	}

	int[] nia(int size) throws IOException {
		int[] ret = new int[size];
		for (int i = 0; i < size; i++)
			ret[i] = ni();
		return ret;
	}

	long[] nla(int size) throws IOException {
		long[] ret = new long[size];
		for (int i = 0; i < size; i++)
			ret[i] = nl();
		return ret;
	}

	double[] nda(int size) throws IOException {
		double[] ret = new double[size];
		for (int i = 0; i < size; i++)
			ret[i] = nd();
		return ret;
	}

	String nextLine() throws IOException {
		strTok = new StringTokenizer("");
		return in.readLine();
	}

	boolean EOF() throws IOException {
		while (!strTok.hasMoreTokens()) {
			String s = in.readLine();
			if (s == null)
				return true;
			strTok = new StringTokenizer(s);
		}
		return false;
	}

	void printRepeat(String s, int count) {
		for (int i = 0; i < count; i++)
			out.print(s);
	}

	void printArray(int[] array) {
		for (int i = 0; i < array.length; i++) {
			if (i > 0)
				out.print(' ');
			out.print(array[i]);
		}
		out.println();
	}

	void printArray(long[] array) {
		for (int i = 0; i < array.length; i++) {
			if (i > 0)
				out.print(' ');
			out.print(array[i]);
		}
		out.println();
	}

	void printArray(double[] array) {
		for (int i = 0; i < array.length; i++) {
			if (i > 0)
				out.print(' ');
			out.print(array[i]);
		}
		out.println();
	}

	void printArray(double[] array, String spec) {
		for (int i = 0; i < array.length; i++) {
			if (i > 0)
				out.print(' ');
			out.printf(Locale.US, spec, array[i]);
		}
		out.println();
	}

	void printArray(Object[] array) {
		boolean blank = false;
		for (Object x : array) {
			if (blank)
				out.print(' ');
			else
				blank = true;
			out.print(x);
		}
		out.println();
	}

	@SuppressWarnings("rawtypes")
	void printCollection(Collection collection) {
		boolean blank = false;
		for (Object x : collection) {
			if (blank)
				out.print(' ');
			else
				blank = true;
			out.print(x);
		}
		out.println();
	}

	static String memoryStatus() {
		return (Runtime.getRuntime().totalMemory()
				- Runtime.getRuntime().freeMemory() >> 20)
				+ "/" + (Runtime.getRuntime().totalMemory() >> 20) + " MB";
	}

	public void pln() {
		out.println();
	}

	public void pln(int arg) {
		out.println(arg);
	}

	public void pln(long arg) {
		out.println(arg);
	}

	public void pln(double arg) {
		out.println(arg);
	}

	public void pln(String arg) {
		out.println(arg);
	}

	public void pln(boolean arg) {
		out.println(arg);
	}

	public void pln(char arg) {
		out.println(arg);
	}

	public void pln(float arg) {
		out.println(arg);
	}

	public void pln(Object arg) {
		out.println(arg);
	}

	public void p(int arg) {
		out.print(arg);
	}

	public void p(long arg) {
		out.print(arg);
	}

	public void p(double arg) {
		out.print(arg);
	}

	public void p(String arg) {
		out.print(arg);
	}

	public void p(boolean arg) {
		out.print(arg);
	}

	public void p(char arg) {
		out.print(arg);
	}

	public void p(float arg) {
		out.print(arg);
	}

	public void p(Object arg) {
		out.print(arg);
	}

}