#include<iostream>

 #include<cstdio>

 #include<cstdlib>

 #include<cstring>

 #include<ctime>

 #include<cmath>

 #include<algorithm>

 using namespace std;

 #define MAXN 1000100

 int n,m,top,stack[MAXN],p[MAXN],f[MAXN];

 char a[MAXN],b[MAXN];

 int main()

 {

     //freopen("cin.in","r",stdin);

     //freopen("cout.out","w",stdout);

     scanf("%s",a+);  scanf("%s",b+);

     n=strlen(a+);  m=strlen(b+);

     for(int i=,j=;i<=m;i++)

     {

         while(j&&b[j+]!=b[i])  j=p[j];

         if(b[j+]==b[i])  j++;

         p[i]=j;

     }

     for(int i=,j=;i<=n;i++)

     {

         j=f[stack[top]];

         while(j&&b[j+]!=a[i])  j=p[j];

         if(b[j+]==a[i])  j++;

         if(j==m)  top-=(m-);

         else stack[++top]=i,f[i]=j;

     }

     for(int i=;i<=top;i++)  printf("%c",a[stack[i]]);

     return ;

 }