#include <iostream>
#include <list>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <chrono>
#include <math.h>
using namespace std;

using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>;
using Wint = std::vector<Vint>;
using Wlli = std::vector<Vlli>;
using Vbool = std::vector<bool>;
using Wbool = std::vector<Vbool>;
using pii = std::pair<int, int>;
using pll = std::pair<lli, lli>;
template <class T>
using Vec = std::vector<T>;

constexpr int MOD = 1e9 + 7;
constexpr int INFi = 2e9 + 1;
constexpr lli INFl = (lli)(9e18) + 1;
const vector<pii> DXDY = {std::make_pair(1, 0), std::make_pair(-1, 0), std::make_pair(0, 1), std::make_pair(0, -1)};
constexpr char BR = '\n';

#define DEBUG(x) std::cerr << #x << " = " << x << '\n';
#define FOR(i, a, b) for(int (i) = (a); (i) < (b); ++(i))
#define FOReq(i, a, b) for(int (i) = (a); (i) <= (b); ++(i))
#define rFOR(i, a, b) for(int (i) = (b); (i) >= (a); --(i))
#define FORstep(i, a, b, step) for(int (i) = (a); i < (b); i += (step))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) rFOR(i, 0, (n-1))
#define vREP(ele, vec) for(auto &(ele) : (vec))
#define vREPcopy(ele, vec) for(auto (ele) : (vec))
#define SORT(A) std::sort((A).begin(), (A).end())
#define RSORT(A) std::sort((A).rbegin(), (A).rend())
// 座標圧縮 (for vector) : ソートしてから使うのが一般的 ; SORT(A) => COORDINATE_COMPRESSION(A)
#define COORDINATE_COMPRESSION(A) (A).erase(unique((A).begin(),(A).end()),(A).end())



template <class T> inline int argmin(std::vector<T> vec){return min_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline int argmax(std::vector<T> vec){return max_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline void chmax(T &a, T b){if(a < b) a = b;}
template <class T> inline void chmin(T &a, T b){if(a > b) a = b;}
template <class T> inline void reverseSORT(Vec<T> &Array){
  std::sort(Array.begin(), Array.end(), std::greater<T>());
}
inline int BitI(int k){return 1 << k;}
inline lli BitL(int k){return 1LL << k;}
inline void putsDouble(double d){printf("%.16lf\n", d);}
inline int toInt(const string &s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline long long int toLong(const string &s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
template <class T> inline std::string toString(T n){
  if(n == 0) return "0";
  std::string res;
  if(n < 0){n = -n;while(n != 0){res += (char)(n % 10 + '0'); n /= 10;}
  std::reverse(res.begin(), res.end()); return '-' + res;}
  while(n != 0){res += (char)(n % 10 + '0'); n /= 10;} std::reverse(res.begin(), res.end()); return res;
}

// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~






int main(void){
    std::string s; cin >> s;
    int x, y; scanf("%d%d", &x, &y);
    int sum_x = 0, sum_y = 0;
    std::queue<int> Qx, Qy;
    bool x_flag = true; int cnt = 0;
    vREP(ele, s){
        if(ele == 'F') cnt++;
        else{
            if(x_flag){ Qx.push(cnt); sum_x += cnt;}
            else { Qy.push(cnt); sum_y += cnt; }
            x_flag = not x_flag;
            cnt = 0;
        }
    }
    if(cnt != 0){
        if(x_flag){ Qx.push(cnt); sum_x += cnt;}
        else { Qy.push(cnt); sum_y += cnt;}
    }
    if(abs(x) > sum_x or abs(y) > sum_y) puts("No");
    else{
        const int size_x = Qx.size(), size_y = Qy.size();
        Wbool XP(size_x, Vbool(2 * sum_x + 1, false)),
              YP(size_y + 1, Vbool(2 * sum_y + 1, false));
        XP[0][sum_x + Qx.front()] = true; Qx.pop();
        REP(i, size_x - 1){
            int diff_x = Qx.front(); Qx.pop();
            REP(j, 2 * sum_x + 1){
                if(XP[i][j]){
                    XP[i+1][j-diff_x] = true;
                    XP[i+1][j+diff_x] = true;
                }
            }
        }
        YP[0][sum_y] = true;
        REP(i, size_y){
            int diff_y = Qy.front(); Qy.pop();
            REP(j, 2 * sum_y + 1){
                if(YP[i][j]){
                    YP[i+1][j-diff_y] = true;
                    YP[i+1][j+diff_y] = true;
                }
            }
        }
        bool flag = XP[size_x-1][sum_x + x] and YP[size_y][sum_y + y];
        puts(flag ? "Yes" : "No");
    }
    return 0;
}

Measured memory_bytes: 2432