st = input().split("T")

x, y = list(map(int, input().split()))

XL = []; YL = []; t = 0

for i in range(len(st)):

    if i % 2 == 0:

        XL.append(len(st[i]))

    else:

        YL.append(len(st[i]))

    t += len(st[i])

if abs(x) + abs(y) > t:

    print("No")

else:

    T = max([abs(x), abs(y), t])

    xx = [[False for j in range(2*T+1)] for i in range(len(XL)+1)]

    yy = [[False for j in range(2*T+1)] for i in range(len(YL)+1)]

    xx[0][T]=True

    yy[0][T]=True

    xx[1][T+XL[0]]=True

    for i in range(2, len(XL)+1):

        for j in range(2*T+1):

            if j-XL[i-1] < 0:

                xx[i][j]=xx[i-1][j+XL[i-1]]

            elif j+XL[i-1] > 2*T:

                xx[i][j]=xx[i-1][j-XL[i-1]]

            else:

                xx[i][j]=xx[i-1][j-XL[i-1]] or xx[i-1][j+XL[i-1]]

    

    for i in range(1,len(YL)+1):

        for j in range(2*T+1):

            if j-YL[i-1] < 0:

                yy[i][j]=yy[i-1][j+YL[i-1]]

            elif j+YL[i-1] > 2*T:

                yy[i][j]=yy[i-1][j-YL[i-1]]

            else:

                yy[i][j]=yy[i-1][j-YL[i-1]] or yy[i-1][j+YL[i-1]]



    if xx[len(XL)][x+T] and yy[len(YL)][y+T]:

        print("Yes")

    else:

        print("No")

s=input().split("T")

x,y=list(map(int,input().split()))

A=[]

B=[]

for i,j in enumerate(s):

    if i%2==0:

        A.append(len(j))

    else:

        B.append(len(j))

T=max([sum(A),sum(B),abs(x),abs(y)])

X=len(A)

Y=len(B)

if abs(x)+abs(y)>sum(A)+sum(B):

    print("No")

    exit()

dpx=[[False for i in range(2*T+1)] for _ in range(X+1)]

dpy=[[False for i in range(2*T+1)] for _ in range(Y+1)]

dpx[0][T]=True

dpy[0][T]=True

for l in range(X):

    for i in range(2*T+1):

        if dpx[l][i]:

            dpx[l+1][i+A[l]]=True

            if l==0:

                continue

            dpx[l+1][i-A[l]]=True

for r in range(Y):

    for i in range(2*T+1):

        if dpy[r][i]:

            dpy[r+1][i-B[r]]=True

            dpy[r+1][i+B[r]]=True

if dpx[X][x+T] and dpy[Y][y+T]:

    print("Yes")

else:

    print("No")



st = input().split("T")
x, y = list(map(int, input().split()))
XL = []
YL = []
t = 0
for i in range(len(st)):
    if i % 2 == 0:
        XL.append(len(st[i]))
    else:
        YL.append(len(st[i]))
    t += len(st[i])
if abs(x) + abs(y) > t:
    print("No")
else:
    T = max([abs(x), abs(y), t])
    xx = [[False for j in range(2 * T + 1)] for i in range(len(XL) + 1)]
    yy = [[False for j in range(2 * T + 1)] for i in range(len(YL) + 1)]
    xx[0][T] = True
    yy[0][T] = True
    xx[1][T + XL[0]] = True
    for i in range(2, len(XL) + 1):
        for j in range(2 * T + 1):
            if j - XL[i - 1] < 0:
                xx[i][j] = xx[i - 1][j + XL[i - 1]]
            elif j + XL[i - 1] > 2 * T:
                xx[i][j] = xx[i - 1][j - XL[i - 1]]
            else:
                xx[i][j] = xx[i - 1][j - XL[i - 1]] or xx[i - 1][j + XL[i - 1]]
    for i in range(1, len(YL) + 1):
        for j in range(2 * T + 1):
            if j - YL[i - 1] < 0:
                yy[i][j] = yy[i - 1][j + YL[i - 1]]
            elif j + YL[i - 1] > 2 * T:
                yy[i][j] = yy[i - 1][j - YL[i - 1]]
            else:
                yy[i][j] = yy[i - 1][j - YL[i - 1]] or yy[i - 1][j + YL[i - 1]]
    if xx[len(XL)][x + T] and yy[len(YL)][y + T]:
        print("Yes")
    else:
        print("No")

s = input().split("T")
x, y = list(map(int, input().split()))
A = []
B = []
for i, j in enumerate(s):
    if i % 2 == 0:
        A.append(len(j))
    else:
        B.append(len(j))
T = max([sum(A), sum(B), abs(x), abs(y)])
X = len(A)
Y = len(B)
if abs(x) + abs(y) > sum(A) + sum(B):
    print("No")
    exit()
dpx = [[False for i in range(2 * T + 1)] for _ in range(X + 1)]
dpy = [[False for i in range(2 * T + 1)] for _ in range(Y + 1)]
dpx[0][T] = True
dpy[0][T] = True
for l in range(X):
    for i in range(2 * T + 1):
        if dpx[l][i]:
            dpx[l + 1][i + A[l]] = True
            if l == 0:
                continue
            dpx[l + 1][i - A[l]] = True
for r in range(Y):
    for i in range(2 * T + 1):
        if dpy[r][i]:
            dpy[r + 1][i - B[r]] = True
            dpy[r + 1][i + B[r]] = True
if dpx[X][x + T] and dpy[Y][y + T]:
    print("Yes")
else:
    print("No")

-st = input().split("T") +s = input().split("T") -XL = [] -YL = [] -t = 0 -for i in range(len(st)): +A = [] +B = [] +for i, j in enumerate(s): -        XL.append(len(st[i])) +        A.append(len(j)) -        YL.append(len(st[i])) -    t += len(st[i]) -if abs(x) + abs(y) > t: +        B.append(len(j)) +T = max([sum(A), sum(B), abs(x), abs(y)]) +X = len(A) +Y = len(B) +if abs(x) + abs(y) > sum(A) + sum(B): +    exit() +dpx = [[False for i in range(2 * T + 1)] for _ in range(X + 1)] +dpy = [[False for i in range(2 * T + 1)] for _ in range(Y + 1)] +dpx[0][T] = True +dpy[0][T] = True +for l in range(X): +    for i in range(2 * T + 1): +        if dpx[l][i]: +            dpx[l + 1][i + A[l]] = True +            if l == 0: +                continue +            dpx[l + 1][i - A[l]] = True +for r in range(Y): +    for i in range(2 * T + 1): +        if dpy[r][i]: +            dpy[r + 1][i - B[r]] = True +            dpy[r + 1][i + B[r]] = True +if dpx[X][x + T] and dpy[Y][y + T]: +    print("Yes") -    T = max([abs(x), abs(y), t]) -    xx = [[False for j in range(2 * T + 1)] for i in range(len(XL) + 1)] -    yy = [[False for j in range(2 * T + 1)] for i in range(len(YL) + 1)] -    xx[0][T] = True -    yy[0][T] = True -    xx[1][T + XL[0]] = True -    for i in range(2, len(XL) + 1): -        for j in range(2 * T + 1): -            if j - XL[i - 1] < 0: -                xx[i][j] = xx[i - 1][j + XL[i - 1]] -            elif j + XL[i - 1] > 2 * T: -                xx[i][j] = xx[i - 1][j - XL[i - 1]] -            else: -                xx[i][j] = xx[i - 1][j - XL[i - 1]] or xx[i - 1][j + XL[i - 1]] -    for i in range(1, len(YL) + 1): -        for j in range(2 * T + 1): -            if j - YL[i - 1] < 0: -                yy[i][j] = yy[i - 1][j + YL[i - 1]] -            elif j + YL[i - 1] > 2 * T: -                yy[i][j] = yy[i - 1][j - YL[i - 1]] -            else: -                yy[i][j] = yy[i - 1][j - YL[i - 1]] or yy[i - 1][j + YL[i - 1]] -    if xx[len(XL)][x + T] and yy[len(YL)][y + T]: -        print("Yes") -    else: -        print("No") +    print("No")