CF346B.Lucky Common Subsequence

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 _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.

在数学中，子序列是指通过删除某个序列中的一些元素（不改变其余元素的顺序）而得到的序列。例如，序列 BDF 是 ABCDEF 的一个子序列。字符串的子串是指该字符串的一个连续子序列。例如，BCD 是 ABCDEF 的一个子串。

给你两个字符串 $s_1$、$s_2$ 和另一个称为 virus 的字符串。你的任务是找出 $s_1$ 和 $s_2$ 的最长公共子序列，且该子序列不包含 virus 作为其子串。

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.

输入包含三行，每行一个字符串：$s_1$、$s_2$ 和 $virus$（$1 \le |s_1|, |s_2|, |virus| \le 100$）。每个字符串仅由大写英文字母组成。

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.

输出字符串 $s_1$ 和 $s_2$ 的最长公共子序列，要求该子序列中不包含子串 virus。如果存在多个答案，输出任意一个即可。

如果不存在满足条件的公共子序列，则输出 0。