/* main code starts from line 123. */

/* ---------- STL Libraries ---------- */

// IO library
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>

// container library
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>


/* ---------- Namespace ---------- */

using namespace std;


/* ---------- Type Abbreviation ---------- */

template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;

using ll = long long;
using PL = P<ll, ll>;
using PS = P<string, ll>;

using VI = V<int>;
using VVI = V<VI>;
using VL = V<ll>;
using VVL = V<VL>;
using VS = V<string>;
using VB = V<bool>;
using VVB = V<VB>;
using VPL = V<PL>;
using VPS = V<PS>;

#define fst first
#define snd second
#define pb push_back


/* ---------- conversion ---------- */

#define INT(c) static_cast<int>(c)
#define CHAR(n) static_cast<char>(n)
#define LL(n) static_cast<ll>(n)
#define DOUBLE(n) static_cast<double>(n)


/* ---------- container ---------- */

#define ALL(v) (v).begin(), (v).end()
#define SIZE(v) (LL((v).size()))

#define FIND(v, k) (v).find(k) != (v).end()
#define EACH(itr, v) for (auto itr = (v).begin(); itr != (v).end(); itr++)
#define REACH(i, v) for (auto itr = (v).rbegin(); itr != (v).rend(); itr++)

#define SORT(v) sort(ALL(v))
#define GSORT(v) sort(ALL(v), greater<decltype((v).front())>())


/* ---------- repetition ---------- */

#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)

#define RFOR(i, a, b) for (ll i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RNREP(i, n) RFOR(i, n, 1)

// Usual REP runs from 0 to n-1 (R: n-1 to 0)
// Natural REP runs from 1 to n (R: n to 1)


/* ---------- Constants ---------- */

// const ll MOD = 1e9 + 7;
// const int INF = 1 << 25;
// const ll INF = 1LL << 50;
// const double PI = 3.14159265358979;
// const ll dx[4] = {0, -1, 1, 0};
// const ll dy[4] = {-1, 0, 0, 1};
// const ll dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
// const ll dy[8] = {-1, -1, -1, 0, 0, 1, 1, 1};


/* ---------- Short Functions ---------- */

template <typename T>
T sq(T a) {
    return a * a;
}


/* ---------- Debug ---------- */

#define GET_VAR_NAME(variable) #variable

#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;
#define testP(p) cout << GET_VAR_NAME(p) << " = (" << (p).fst << ", " << (p).snd << ")" << endl;
#define testP2(a, b) cout << "(" << a << ", " << b << ")" << endl;


/* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */

/* ---------- Global Variance ----------- */

/* ------------- Functions -------------- */

bool arrivable(int dis, const VI& move, int maxd) {
    if (dis % 2 > 0 || dis < 0) {
        return false;
    }

    dis /= 2;

    VVB dp(SIZE(move) + 1, VB(maxd + 1, false));
    // dp[i][j] = i個目までの移動でjだけ移動できるか

    dp[0][0] = true;
    // 初期条件

    NREP(i, SIZE(move)) {
        REP(j, maxd + 1) {
            if (dp[i - 1][j]) {
                dp[i][j] = true;
                dp[i][j + move[i - 1]] = true;
            }
        }
    }

    if (dp[SIZE(move)][dis]) {
        return true;
    } else {
        return false;
    }
}

/* ----------- Main Function ------------ */

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    string s;
    int p[2];
    cin >> s >> p[0] >> p[1];
    s.pb('T');
    // 最後がFだと処理が面倒なので

    VVI move(2);
    // move[0]がx方向、move[1]がy座標

    int maxd[2] = {0, 0};
    // 各座標について到達しうる最大の絶対値

    int dir = 0, dis = 0, firstx = true;
    for (char c : s) {
        if (c == 'F') {
            dis++;
        } else {
            if (firstx) {
                // 最初の前進だけはx正方向にしか進めない
                // よって目標のxから減らすことで対処する

                p[0] -= dis;
                firstx = false;
            } else if (dis > 0) {
                move[dir].pb(dis);
                maxd[dir] += dis;
            }
            dir = (dir + 1) % 2;
            dis = 0;
        }
    }

    REP(i, 2) {
        if (!arrivable(maxd[i] - abs(p[i]), move[i], maxd[i])) {
            cout << "No" << endl;
            return 0;
        }
    }

    cout << "Yes" << endl;
    return 0;
}

Measured memory_bytes: 1408