import sys
from collections import deque,defaultdict
#import pypyjit
import itertools
import heapq
import bisect
import queue

#pypyjit.set_param("max_unroll_recursion=-1")
#sys.setrecursionlimit(10 ** 9)
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
ml = lambda: map(str, input().split())
li = lambda: list(mi())
li_st = lambda: list(map(str, input().split()))
lli = lambda n: [li() for _ in range(n)]
mod = 998244353
INF = 8 * 10**18

S = input()
T = input()
P = [0,0,0,0]

for i in range(4):
  lis = [0,0,0]
  if S[i // 2] == "A":
    lis[0] += 1
  elif S[i // 2] == "B":
    lis[1] += 1
  else:
    lis[2] += 1
    
  if T[i % 2] == "A":
    lis[0] += 1
  elif T[i % 2] == "B":
    lis[1] += 1
  else:
    lis[2] += 1
  
  #judge
  if lis[0] >= 1 and lis[1] == 0:
    P[0] += 25
  elif lis[1] >= 1 and lis[0] == 0:
    P[1] += 25
  elif lis[0] == 1 and lis[1] == 1:
    P[2] += 25
  else:
    P[3] += 25

print(*P)