Codeforces Amusing Joke

/*
Lionel Messi is such a player that you may catch him, you may touch him, you may feel him
and definitely you may Love him.
Lionel Messi is Messi. A little Magician in this World.

*/

#include<bits/stdc++.h>

using namespace std;

#define fast ios_base::sync_with_stdio(0)
#define bfast cin.tie(0)
#define outs(x) cout << x << " "
#define outn(x) cout << x << "\n"
#define sf scanf
#define pf printf
#define nl puts("")
#define psb push_back
#define loop0(n) for(int i=0; i<n; i++)
#define loop1(n) for(int i=1; i<=n; i++)
#define mpair(x , y) make_pair(x , y)
#define all(x) x.begin(), x.end()
#define pi acos(-1.0)

typedef unsigned long long ull;
typedef long long LL;
typedef vector<int>vii;
typedef vector<LL>vll;
typedef map<int, int>mpii;
typedef map<string, int>mpsi;
typedef map<char, int>mpci;
typedef map<LL, LL>mpll;

const int mod = 1000007;
const int high = 100;


struct printf
{
    void ek(int n){cout << n << "\n";}
    void dui(int x , int y) { cout << x << " " << y << "\n"; }
    void tin(int x , int y , int z) { cout << x << " " << y << " " << z << "\n"; }
}tp;

struct sieve
{
    int prm[high], plen=0;
    bitset<high>bs;
    void get_prime()
    {
        LL i , j;
        bs.set();
        bs[0]=bs[1]=0;
        for(i=2; i<=high; i++)
        {
            if(bs[i])
            {
                prm[plen++] = i;

                for(j=i*i; j<=high; j+=i) bs[j] = 0;
            }
        }
    }
    void pprm(){ for(int i=0; i<100; i++) cout << prm[i] << "; "; }
}prime;

char ch[103];

int main()
{
    fast;
    string guest, host, suffle , tmp;
    int i=0 , chlen=0 , len=0;
    mpci mp;
    while(cin >> guest >> host >> suffle)
    {
        mp.clear();

        tmp = suffle;

        len = guest.length();

        chlen=0;

        for(i=0; i<len; i++)
        {
            if(mp.count(guest[i])==0)
            {
                   ch[chlen++] = guest[i];
                   mp[guest[i]]+= 1;
            }

            else
            {
                mp[guest[i]]++;
            }
        }

        len = host.length();

        for(i=0; i<len; i++)
        {
            if(mp.count(host[i]) == 0)
            {
                ch[chlen++] = host[i];

                mp[host[i]]+=1;
            }

            else
            {
                mp[host[i]]++;
            }
        }

        len = suffle.length();

        for(i=0; i<len; i++)
        {
            if(mp[suffle[i]])
            {
                mp[suffle[i]]--;
            }

            else mp[suffle[i]]++;
        }

        bool f=false , fl = false;

        for(i=0; i<chlen; i++)
        {
            //cout << ch[i] << "-" << mp[ch[i]] << "\n";

            if(mp[ch[i]])
            {
                f=true;
                break;
            }
        }

        len = tmp.length();

        for(i=0; i<len; i++)
        {
            if(mp[tmp[i]])
            {
                fl=true;
                break;
            }
        }

        if(f==true or fl==true) outn("NO");
        else outn("YES");
    }

    return 0;
}