#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int fx[] = {-1, +0, +1, +0, +1, +1, -1, -1, +0};
int fy[] = {+0, -1, +0, +1, +1, -1, +1, -1, +0};
int day[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
template <typename T>
inline bool isLeap(T y) {
  return (y % 400 == 0) || (y % 100 ? y % 4 == 0 : false);
}
template <typename T>
inline T GCD(T a, T b) {
  a = abs(a);
  b = abs(b);
  if (a < b) swap(a, b);
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
template <typename T>
inline T EGCD(T a, T b, T &x, T &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  T x1, y1;
  T d = EGCD(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
template <typename T>
inline T LCM(T x, T y) {
  T tp = GCD(x, y);
  if ((x / tp) * 1. * y > 9e18) return 9e18;
  return (x / tp) * y;
}
template <typename T>
inline T BigMod(T A, T B, T M = MOD) {
  T ret = 1;
  while (B) {
    if (B & 1) ret = (ret * A) % M;
    A = (A * A) % M;
    B = B >> 1;
  }
  return ret;
}
template <typename T>
inline T InvMod(T A, T M = MOD) {
  return BigMod(A, M - 2, M);
}
template <typename T>
T scani(T &n) {
  n = 0;
  bool negative = false;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') negative = true;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    n = n * 10 + c - 48;
    c = getchar();
  }
  if (negative) n = ~(n - 1);
  return n;
}
template <typename T>
void write(T n, int type = true) {
  if (n < 0) {
    putchar('-');
    n = -n;
  }
  if (!n) {
    putchar('0');
    if (type == 32)
      putchar(' ');
    else if (type)
      putchar('\n');
    return;
  }
  char buff[22];
  int len = 0;
  while (n) buff[len++] = n % 10 + 48, n /= 10;
  for (int i = len - 1; i >= 0; i--) putchar(buff[i]);
  if (type == 32)
    putchar(' ');
  else if (type)
    putchar('\n');
}
int scans(char *a) {
  int i = 0;
  char c = 0;
  while (c < 33) c = getchar();
  while (c > 33) {
    a[i++] = c;
    c = getchar();
  }
  a[i] = 0;
  return i;
}
void zAlgo(char *s, int *z) {
  int L, R, sz;
  sz = strlen(s);
  z[0] = L = R = 0;
  for (int i = (1); i < (sz); ++i) {
    z[i] = 0;
    if (i <= R) z[i] = min(z[i - L], R - i + 1);
    while (i + z[i] < sz && s[i + z[i]] == s[z[i]]) z[i]++;
    if (i + z[i] - 1 > R) L = i, R = i + z[i] - 1;
  }
}
void zAlgo(string &s, int *z) {
  int L, R, sz;
  sz = s.size();
  z[0] = L = R = 0;
  for (int i = (1); i < (sz); ++i) {
    z[i] = 0;
    if (i <= R) z[i] = min(z[i - L], R - i + 1);
    while (i + z[i] < sz && s[i + z[i]] == s[z[i]]) z[i]++;
    if (i + z[i] - 1 > R) L = i, R = i + z[i] - 1;
  }
}
void zAlgo(int *s, int *z, int n) {
  int L, R, sz;
  sz = n;
  z[0] = L = R = 0;
  for (int i = (1); i < (sz); ++i) {
    z[i] = 0;
    if (i <= R) z[i] = min(z[i - L], R - i + 1);
    while (i + z[i] < sz && s[i + z[i]] == s[z[i]]) z[i]++;
    if (i + z[i] - 1 > R) L = i, R = i + z[i] - 1;
  }
}
template <typename T>
inline T SqrDis(T x1, T y1, T x2, T y2) {
  return ((x1 - x2) * (x1 - x2)) + ((y1 - y2) * (y1 - y2));
}
template <typename T>
inline T Area2(T Ax, T Ay, T Bx, T By, T Cx, T Cy) {
  T ret = Ax * (By - Cy) + Bx * (Cy - Ay) + Cx * (Ay - By);
  if (ret < 0) return ret = -ret;
  return ret;
}
const int N = 2000006;
const int M = 44444;
const unsigned long long hs = 3797;
int dp[111][111][111], na, nb, nc, phi[111];
char a[111], b[111], c[111];
int ans_me(int x, int y, int sz) {
  if (sz >= nc) return -0x3f3f3f3f;
  if (x > na || y > nb) return 0;
  int &ret = dp[x][y][sz];
  if (ret != -1) return ret;
  ret = max(ans_me(x + 1, y, sz), ans_me(x, y + 1, sz));
  if (a[x] == b[y]) {
    while (sz && a[x] != c[sz + 1]) sz = phi[sz];
    if (a[x] == c[sz + 1]) sz++;
    ret = max(ret, 1 + ans_me(x + 1, y + 1, sz));
  }
  return ret;
}
void path(int x, int y, int sz) {
  if (sz >= nc) return;
  if (x > na || y > nb) return;
  int ret = ans_me(x, y, sz);
  if (ret == ans_me(x + 1, y, sz))
    path(x + 1, y, sz);
  else if (ret == ans_me(x, y + 1, sz))
    path(x, y + 1, sz);
  else if ((a[x] == b[y])) {
    while (sz && a[x] != c[sz + 1]) sz = phi[sz];
    if (a[x] == c[sz + 1]) sz++;
    if (ret == 1 + ans_me(x + 1, y + 1, sz)) {
      printf("%c", a[x]);
      path(x + 1, y + 1, sz);
    }
  } else {
    cerr << "if the code comes here then there is a problem\n";
    assert(true);
  }
}
int main() {
  memset(dp, -1, sizeof dp);
  na = scans(a + 1);
  nb = scans(b + 1);
  nc = scans(c + 1);
  for (int i = 2, j = 0; i <= nc; i++) {
    while (j && c[j + 1] != c[i]) j = phi[j];
    if (c[j + 1] == c[i]) phi[i] = ++j;
  }
  cerr << ans_me(1, 1, 0) << '\n';
  if (ans_me(1, 1, 0) <= 0)
    puts("0");
  else
    path(1, 1, 0);
  return 0;
}
