# oj t -c "python3 main.py"
import sys,math
from collections import defaultdict,deque
from itertools import combinations,permutations,accumulate,product
from bisect import bisect_left,bisect_right
from heapq import heappop,heappush,heapify
#from more_itertools import distinct_permutations,distinct_combinations
#from sortedcontainers import SortedList,SortedSet
def input():return sys.stdin.readline().rstrip()
def ii(): return int(input())
def ms(): return map(int, input().split())
def li(): return list(map(int,input().split()))
inf = pow(10,18)
mod = 998244353
#/////////////////////////////////
S = input()
T = input()
ans = [0]*4
for s in S:
    for t in T:
        if "A" in [s,t] and "B" not in [s,t]:
            ans[0] += 1
        if "A" not in [s,t] and "B" in [s,t]:
            ans[1] += 1
        if "A" in [s,t] and "B" in [s,t]:
            ans[2] += 1
        if "A" not in [s,t] and "B" not in [s,t]:
            ans[3] += 1

for a in ans:
    print(a*100//4,end=" ")
print()