#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;

int main(void)
{
	string s, t; cin >> s >> t;

	vector<string> l(4);
	rep(i, 2) rep(j, 2)
	{
		l[i * 2 + j] = "";
		l[i * 2 + j] += s[i];
		l[i * 2 + j] += t[j];
	}

	vector<string> a(4);

	rep(i, 4)
	{
		if (l[i].find('A') != string::npos)
		{
			if (l[i].find('B') != string::npos)
			{
				a[i] = "AB";
			}
			else
			{
				a[i] = "A";
			}
		}
		else if (l[i].find('B') != string::npos)
		{
			a[i] = "B";
		}
		else
		{
			a[i] = "O";
		}
	}

	map<string, int> m;
	rep(i, 4) m[a[i]]++;

	cout << m["A"]*25 << " " << m["B"]*25 << " " << m["AB"]*25 << " " << m["O"]*25 << endl;

	return 0;
}