using System;
using System.Collections.Generic;
using System.Linq;
using System.Web;

namespace Competitive
{
    internal class Solution
    {
        public int L;
        public string S;
        public List<int> H, V;
        public int X, Y;
        public void Run()
        {
            S = Console.ReadLine();
            L = S.Length;
            {
                var line = Input.ReadIntArray();
                X = line[0];
                Y = line[1];
            }

            H = new List<int>();
            V = new List<int>();

            {
                int i = 0;
                while (i < L && S[i] == 'F')
                {
                    X--;
                    i++;
                }

                bool isHorizontal = true;
                int c = 0;
                while (i <= L)
                {
                    if (i == L || S[i] == 'T')
                    {
                        if (isHorizontal)
                        {
                            H.Add(c);
                        }
                        else
                        {
                            V.Add(c);
                        }
                        c = 0;
                        isHorizontal = !isHorizontal;
                    }
                    else
                    {
                        c++;
                    }

                    i++;
                }
            }
            X = Math.Abs(X);
            Y = Math.Abs(Y);

            Console.Error.WriteLine(string.Join(", ", H));
            Console.Error.WriteLine(string.Join(", ", V));

            H = H.Where(e => e != 0).ToList();
            V = V.Where(e => e != 0).ToList();

            var success = Run(H, X) && Run(V, Y);

            Console.WriteLine(success ? "Yes" : "No");
        }

        public bool Run(List<int> A, int goal)
        {
            int mx = L; // A.Sum();
            if (goal > mx) return false;
            bool[,] dp = new bool[A.Count + 1, mx + 1];
            dp[0, 0] = true;
            for (int i = 0; i < A.Count; i++)
            {
                for (int j = 0; j <= mx; j++)
                {
                    if (dp[i, j])
                    {
                        int a1 = Math.Abs(j + A[i]);
                        int a2 = Math.Abs(j - A[i]);
                        dp[i + 1, a1] = true;
                        dp[i + 1, a2] = true;
                    }
                }
            }

            return dp[A.Count, goal];
        }
    }

    // libs ----------
    

    // common ----------

    internal static class Input
    {
        public static string ReadString()
        {
            string line = Console.ReadLine();
            return line;
        }

        public static int ReadInt()
        {
            string line = Console.ReadLine();
            return int.Parse(line);
        }

        public static int[] ReadIntArray()
        {
            string line = Console.ReadLine();
            return line.Split(' ').Select(int.Parse).ToArray();            
        }

        public static long ReadLong()
        {
            string line = Console.ReadLine();
            return long.Parse(line);
        }

        public static long[] ReadLongArray()
        {
            string line = Console.ReadLine();
            return line.Split(' ').Select(long.Parse).ToArray();
        }

        public static double[] ReadDoubleArray()
        {
            string line = Console.ReadLine();
            return line.Split(' ').Select(double.Parse).ToArray();
        }
    }
    
    internal class Program
    {
        public static void Main(string[] args)
        {
            var s = new Solution();
            s.Run();
        }
    }
}

Measured memory_bytes: 41056