#include <bits/stdc++.h>
using namespace std;
const long long MAXN = (long long)((1e5) + 100);
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
void pr(long long x) { cout << x; }
void prl(long long x) { cout << x << "\n"; }
long long cbrt(long long x) {
  long long lo = 1, hi = min(2000000ll, x);
  while (hi - lo > 1) {
    long long mid = (lo + hi) / 2;
    if (mid * mid * mid < x) {
      lo = mid;
    } else
      hi = mid;
  }
  if (hi * hi * hi <= x)
    return hi;
  else
    return lo;
}
const long long dx[4] = {-1, 1, 0, 0};
const long long dy[4] = {0, 0, -1, 1};
long long XX[] = {-1, -1, -1, 0, 0, 1, 1, 1};
long long YY[] = {-1, 0, 1, -1, 1, -1, 0, 1};
const long long N = (long long)(1 * 1e6 + 10);
signed main() {
  string s1, s2, s3;
  cin >> s1 >> s2 >> s3;
  long long flag = 0;
  unordered_map<char, long long> mp1, mp2, mp3;
  for (long long i = 0; i < s1.size(); i++) mp1[s1[i]]++;
  for (long long i = 0; i < s2.size(); i++) mp1[s2[i]]++;
  for (long long i = 0; i < s3.size(); i++) mp3[s3[i]]++;
  for (long long i = 0; i < s3.size(); i++) {
    if (mp3[s3[i]] == mp1[s3[i]])
      continue;
    else {
      flag = 1;
      break;
    }
  }
  for (long long i = 0; i < s2.size(); i++) {
    if (mp1[s2[i]] == mp3[s2[i]])
      continue;
    else {
      flag = 1;
      break;
    }
  }
  for (long long i = 0; i < s1.size(); i++) {
    if (mp3[s1[i]] == mp1[s1[i]])
      continue;
    else {
      flag = 1;
      break;
    }
  }
  if (flag == 0)
    cout << "YES";
  else
    cout << "NO";
}
