from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations
from functools import cmp_to_key, cache
from heapq import heappop, heappush
import math, sys
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10**7)
_int = lambda x: int(x)-1
MOD = 998244353
INF = 1<<62
Yes, No = "Yes", "No"

S = input()
T = input()

a, b, ab, o = 0, 0, 0, 0
for i in range(2):
    for j in range(2):
        st = {S[i], T[j]}
        if "A" in st and "B" in st:
            ab += 25
        elif "A" in st:
            a += 25
        elif "B" in st:
            b += 25
        else:
            o += 25
print(a, b, ab, o)