#include <iostream>

#include <cstdio>

#include <cstring>

#define maxn 50550

using namespace std;

char s0[],s1[],s[maxn];

int f[],L;

bool tag[maxn];

int n,m;

bool equal(char c1,char c2)

{

    if (c1==c2) return true;

    if (c1>c2) swap(c1,c2);

    c1=c1-'A'+'a';

    if (c1==c2) return true;

    return false;

}

void getfail()

{

    memset(f,,sizeof f);

    f[]=;

    for (int i=; s0[i]; i++)

    {

        int k=f[i-];

        while (k && equal(s0[k+],s0[i])==false) k=f[k];

        if (equal(s0[k+],s0[i])) f[i]=k+;

            else f[i]=;

    }

}

void trans(char ss[])

{

    for (int i=; ss[i]; i++)

    {

        if (ss[i]>='A' && ss[i]<='Z') ss[i]=ss[i]-'A'+'a';

    }

}

int main()

{

    while (gets(s0+))

    {

        gets(s1+),gets(s+);

        getfail();

        L=strlen(s0+);

        memset(tag,false,sizeof tag);

        int cur=;

        for (int i=; s[i]; i++)

        {

            if (equal(s0[cur+],s[i])) cur++;

            else

            {

                int k=f[cur];

                while (k && equal(s0[k+],s[i])==false) k=f[k];

                if (equal(s0[k+],s[i])) cur=k+;

                    else cur=;

            }

            if (cur==L)

            {

                tag[i]=true;

                cur=;

            }

        }

        for (int i=; s[i]; i++)

        {

            if (tag[i+L-]==true)

            {

                printf("%s",s1+);

                i=i+L-;

            }

            else  printf("%c",s[i]);

        }

        printf("\n");

    }

    return ;

}