#include <bits/stdc++.h>

using namespace std;

#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define bitcnt __builtin_popcount
#define SZ(x) ((ll)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
#define CINT(...)                                                              \
    int __VA_ARGS__;                                                           \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    ll __VA_ARGS__;                                                            \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v)                                                              \
    {                                                                          \
        FOREACH(x, v) { cout << x << " "; }                                    \
        cout << "\n";                                                          \
    }
template <typename T = string> inline void eputs(T s) {
    cout << s << "\n";
    exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;

typedef long long ll;
typedef unsigned long long ul;
typedef vector<ll> VL;
typedef pair<ll, ll> PL;

const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18 + 1;
const ll dx[] = {1, -1, 0, 0};
const ll dy[] = {0, 0, 1, -1};

ll x, y, N;
string s;
VL d[2];
bool dpx[2][16001], dpy[2][16001];

signed main() {
    cin >> s >> x >> y;
    N = s.length();
    ll dir = 0, tmp = 0;
    REP(i, N) {
        if(s[i] == 'T') {
            d[dir].emplace_back(tmp);
            tmp = 0, dir ^= 1;
        } else {
            tmp++;
            if(i == N - 1) {
                d[dir].emplace_back(tmp);
            }
        }
    }
    bool judge = false;
    ll N1 = d[0].size(), N2 = d[1].size(), next = 1, now = 0;
    dpx[now][8000] = true;
    REP(i, N1) {
        ll f = d[0][i];
        Fill(dpx[next], false);
        REP(j, 16001) {
            if(j + f <= 16000)
                dpx[next][j + f] = dpx[now][j + f] || dpx[now][j];
            if(i != 0 && j - f >= 0)
                dpx[next][j - f] = dpx[next][j - f] || dpx[now][j];
        }
        swap(now, next);
    }
    judge = dpx[now][x + 8000];
    now = 0, next = 1;
    dpy[now][8000] = true;
    REP(i, N2) {
        ll f = d[1][i];
        Fill(dpy[next], false);
        REP(j, 16001) {
            if(j + f <= 16000)
                dpy[next][j + f] = dpy[next][j + f] || dpy[now][j];
            if(j - f >= 0) dpy[next][j - f] = dpy[next][j - f] || dpy[now][j];
        }
        swap(now, next);
    }
    judge = judge && dpy[now][y + 8000];
    Yes(judge);
}

Measured memory_bytes: 384