#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cstdio>
#include <cmath>
#include <cassert>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

string ketsueki(char s, char t) {
    if ((s == 'A' || t == 'A') && (s != 'B' && t != 'B')) return "A";
    if ((s == 'B' || t == 'B') && (s != 'A' && t != 'A')) return "B";
    if ((s == 'A' || t == 'A') && (s == 'B' || t == 'B')) return "AB";
    return "O";
}

signed main() {
    string s, t;
    map<string, int> mp;
    cin >> s >> t;
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 2; j++) {
            string res = ketsueki(s[i], t[j]);
            //cout << s[i] << ", " << t[j] << " -> " << res << endl;
            mp[res]++;
        }
    }

    printf("%lld %lld %lld %lld\n", mp["A"] * 25, mp["B"] * 25, mp["AB"] * 25, mp["O"] * 25);
    return 0;
}