#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

#include<cmath>

#include<queue>

#include<vector>

#include<map>

using namespace std;

typedef unsigned long long LL;

#define met(a,b) (memset(a,b,sizeof(a)))

const int INF = 1e9+;

const int N = ;

const int MOD = ;

int dp[N][N];

int main()

{

    char s1[N], s2[N], s[N*];

    while(scanf("%s%s%s", s1+, s2+, s+)!=EOF)

    {

        int len1=strlen(s1+), len2=strlen(s2+), i, j;

        int len = strlen(s+);

        ///printf("%d %d %d\n", len1, len2, len);

        if(len1+len2!=len)

        {

            printf("No\n");

            continue;

        }

        met(dp, );

        dp[][] = ;

        for(i=; i<=len1; i++)

        for(j=; j<=len2; j++)

        {

            if(i== && j==) continue;

            if(s1[i]==s[i+j] && dp[i-][j] && !dp[i][j])

                dp[i][j] = dp[i-][j];

            if(s2[j]==s[i+j] && dp[i][j-] && !dp[i][j])

                dp[i][j] = dp[i][j-];

        }

        /**

        for(i=0; i<=len1; i++)

        for(j=0; j<=len2; j++)

        {

            printf("%d%c", dp[i][j], j==len2?'\n':' ');

        }

        */

        if(dp[len1][len2]) printf("Yes\n");

        else   printf("No\n");

    }

    return ;

}