141A - Amusing Joke

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
int a[30], b[30];

int main() {

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

    string s1, s2, s3;
    memset(a, 0, sizeof(a));
    memset(b, 0, sizeof(b));
    cin >> s1 >> s2 >> s3;
    int len1 = s1.length();
    int len2 = s2.length();
    int len3 = s3.length();
    int i, j, k;
    i = j = k = 0;

    while(i < len1 || j < len2 || k < len3) {
        if(i < len1) {
            a[s1[i]-'A']++;
            i++;
        }
        if(j < len2) {
            a[s2[j]-'A']++;
            j++;
        }
        if(k < len3) {
            b[s3[k]-'A']++;
            k++;
        }
    }
    bool ok = true;
    for(i = 0; i < 26; ++i) {
        if(a[i] != b[i]) {
            ok = false;
            break;
        }
    }
    cout << (ok ? "YES" : "NO") << endl;
    return 0;
}