Please, try EDU on Codeforces! New educational section with videos, subtitles, texts, and problems.
×

Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Lucky Common Subsequence

time limit per test

3 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputIn 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 *s* _{1}, *s* _{2} and another string called *virus*. Your task is to find the longest common subsequence of *s* _{1} and *s* _{2}, such that it doesn't contain *virus* as a substring.

Input

The input contains three strings in three separate lines: *s* _{1}, *s* _{2} and *virus* (1 ≤ |*s* _{1}|, |*s* _{2}|, |*virus*| ≤ 100). Each string consists only of uppercase English letters.

Output

Output the longest common subsequence of *s* _{1} and *s* _{2} 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

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/09/2020 14:41:20 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|