#include <bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long; // -2^63 ~ 2^63-1 (9.2*10^18)
using ull = unsigned long long; // 0 ~ 2^64-1 (1.8*10^19)
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for (int i = (m); (i) < int (n); i++)
#define all(v) v.begin(), v.end()
#define bit(n) (1ll<<(n)) // 2^n
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define pb emplace_back
template<class T> using maxpq = priority_queue<T>;
template<class T> using minpq = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll llINF = 1000000000000000000;
void YesNo(bool flag){
    if(flag) cout << "Yes" << endl;
    else cout << "No" << endl;
}
// 多次元vector生成
template<ll idx = 0, ll n, class T>
auto make_vec(const ll (&d)[n], T&& init) noexcept {
    if constexpr (idx < n) return std::vector(d[idx], make_vec<idx + 1>(d, std::forward<T>(init)));
    else return init;
}
template<class T, ll idx = 0, ll n>
auto make_vec(const ll (&d)[n], const T& init = {}) noexcept {
    if constexpr (idx < n) return std::vector(d[idx], make_vec<idx + 1>(d, init));
    else return init;
}
// auto 変数名 = make_vec<型>({a, b, ...}, 初期値);

int main(){
    string S, T;
    cin >> S >> T;
    vector<string> data;
    rep(i, 2){
        rep(j, 2){
            string tmp = "";
            tmp += S[i];
            tmp += T[j];
            data.pb(tmp);
        }
    }
    rep(i, sz(data)){
        sort(all(data[i]));
    }

    int A = 0, B = 0, AB = 0, O = 0;
    rep(i, 4){
        if(data[i][0] == 'A' && data[i][1] != 'B'){
            A += 25;
        }
        else if(data[i][0] == 'B'){
            B += 25;
        }
        else if(data[i][0] == 'A' && data[i][1] == 'B'){
            AB += 25;
        }
        else{
            O += 25;
        }
    }

    cout << A << " " << B << " " << AB << " " << O << endl;
}