#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;


unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

class UnionFind {
public:
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}

int main() {
    string s;
    ll x;
    ll y;
    cin >> s >> x >> y;
    vector<ll> xx;
    vector<ll> yy;
    ll u = 0;
    ll now = 0;
    ll nows = 0;
    while (s[nows] == 'F') {
        x--;
        nows++;
        u++;
        if (nows == s.size())break;
    }
    ll ima=0;
    for (int i = u; i < s.size(); i++) {
        if (s[i] == 'T') {
            if (now == 0&&ima!=0) {
                xx.push_back(ima);
            }
            if (now == 1 && ima != 0) {
                yy.push_back(ima);
            }
            now++;
            now %= 2;
            ima = 0;
        }
        else{
            ima++;
        }
    }
    
    if (now == 0 && ima != 0) {
        xx.push_back(ima);
    }
    if (now == 1 && ima != 0) {
        yy.push_back(ima);
    }
    vector<ll> zx(20000);
    vector<ll> zy(20000);
    zx[10000] = 1;
    zy[10000] = 1;
    for (int i = 0; i < xx.size(); i++) {
        vector<ll> zzx(20000);
        for (int j = 0; j < 20000; j++) {
            zzx[j] = zx[j];
        }
        for (int j = 0; j < 20000; j++) {
            if (j + xx[i] < 20000) {
                if (zzx[j + xx[i]] == 1)zx[j] = 1;
            }
            if (j - xx[i] > 0) {
                if (zzx[j - xx[i]] == 1)zx[j] = 1;
            }
        }
    }
    for (int i = 0; i < yy.size(); i++) {
        vector<ll> zzy(20000);
        for (int j = 0; j < 20000; j++) {
            zzy[j] = zy[j];
            zy[j] = 0;
        }
        for (int j = 0; j < 20000; j++) {
            if (j + yy[i] < 20000) {
                if (zzy[j + yy[i]] == 1)zy[j] = 1;
            }
            if (j - yy[i] > 0) {
                if (zzy[j - yy[i]] == 1)zy[j] = 1;
            }
        }
    }
    if (zx[10000 + x] == 1 && zy[10000+y] == 1)cout << "Yes" << endl;
    else cout << "No" << endl;
}

Measured memory_bytes: 768