#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
string a, b, v, c;
int dp[101][101][101], sol[101][101][101], newP[101][101][101];
vector<int> F;
void getFailure() {
  int k = 0;
  F.resize(v.size());
  F[0] = 0;
  for (int i = 1; i < v.size(); i++) {
    while (k && v[k] != v[i]) k = F[k - 1];
    if (v[k] == v[i]) k++;
    F[i] = k;
  }
}
int solve(int i = 0, int j = 0, int p = 0) {
  if (p == v.size()) return -10000;
  if (i == a.size() || j == b.size()) return 0;
  int &ret = dp[i][j][p];
  if (ret != -1) return ret;
  ret = 0;
  newP[i][j][p] = p;
  int save = p;
  if (a[i] == b[j]) {
    while (p && v[p] != a[i]) p = F[p - 1];
    if (a[i] == v[p]) ++p;
    ret = 1 + solve(i + 1, j + 1, p);
    swap(save, p);
    sol[i][j][p] = 3;
  }
  int x = solve(i + 1, j, p), y = solve(i, j + 1, p);
  if (x > ret) {
    ret = x;
    sol[i][j][p] = 1;
  }
  if (y > ret) {
    ret = y;
    sol[i][j][p] = 2;
  }
  if (sol[i][j][p] == 3) newP[i][j][p] = save;
  return ret;
}
int main() {
  cin >> a >> b >> v;
  memset(dp, -1, sizeof dp);
  getFailure();
  int x = solve();
  int i, j, p, cnt;
  i = j = p = cnt = 0;
  if (!x) puts("0");
  while (i < a.size() && j < b.size() && cnt < x) {
    if (sol[i][j][p] == 3) {
      putchar(a[i]);
      p = newP[i][j][p];
      ++i, ++j, ++cnt;
    } else if (sol[i][j][p] == 1)
      ++i;
    else if (sol[i][j][p] == 2)
      ++j;
  }
  return 0;
}
