#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define eachdo(v, e) for(const auto& e : (v))
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e) (long long)distance((v).begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e) (long long)distance((v).begin(), upper_bound((v).begin(), (v).end(), e))
long long mpow(long long a, long long n, long long mod = MOD){long long res = 1; while(n > 0){if(n & 1)res = res * a % mod; a = a * a % mod; n >>= 1;} return res;}
void yn(bool j){cout << (j ? "Yes" : "No") << endl; return;}
template<class Head> void pt(Head&& head){cout << head << endl; return;}
template<class Head, class... Tail> void pt(Head&& head, Tail&&... tail){cout << head << " "; pt(forward<Tail>(tail)...);}
template<class T> void debug(T v){rep(i, v.size()) cout << v[i] << " " ; cout << endl;}
template<class T> void debug2(T v){rep(i, v.size()){rep(j, v[i].size()) cout << v[i][j] << " " ; cout << endl;}}
template<class T1, class T2> long long bcount(T1 v, T2 a){return upper_index(v, a) - lower_index(v, a);} 
template<class T1, class T2> inline bool chmin(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}
template<class T1, class T2> inline bool chmax(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

int main(){
    string s; cin >> s;
    ll x, y; cin >> x >> y;
    ll seq = 0;
    ll condition = 0;
    vector<ll> ver(1, 0), hol(1, 0), right(1, 0);
    rep(i, s.size()){
        if(condition == 0 && s[i] == 'F'){
            seq++;
            if (i == s.size() - 1) right.push_back(seq);
        }else if(condition == 1 && s[i] == 'F'){
            seq++;
            if (i == s.size() - 1) ver.push_back(seq);
        }else if(condition == 2 && s[i] == 'F'){
            seq++;
            if (i == s.size() - 1) hol.push_back(seq);
        }else if(condition == 0 && s[i] == 'T'){
            right.push_back(seq);
            seq = 0;
            condition = 1;
        }else if(condition == 1 && s[i] == 'T'){
            ver.push_back(seq);
            seq = 0;
            condition = 2;
        }else if(condition == 2 && s[i] == 'T'){
            hol.push_back(seq);
            seq = 0;
            condition = 1;
        }
    }
    // debug(right);
    // debug(ver);
    // debug(hol);
    ll sright = accumulate(all(right), 0LL);
    ll sver = accumulate(all(ver), 0LL);
    ll shol = accumulate(all(hol), 0LL);
    x -= sright;
    x = abs(x);
    y = abs(y);
    vector<vector<ll>> dp0(ver.size() + 1, vector<ll>(max(sver + 1, y + 1), 0));
    vector<vector<ll>> dp1(hol.size() + 1, vector<ll>(max(shol + 1, x + 1), 0));
    dp0[0][0] = 1;
    dp1[0][0] = 1;
    rep(i, ver.size())rep(j, sver + 1){
        // dp0[i + 1][j] = dp0[i + 1][j] | dp0[i][j];
        if (0 <= j - ver[i]) dp0[i + 1][j] = dp0[i + 1][j] | dp0[i][j - ver[i]];  
        if (j + ver[i] <= sver)dp0[i + 1][j] = dp0[i + 1][j] | dp0[i][j + ver[i]];  
    }
    rep(i, hol.size())rep(j, shol + 1){
        // dp1[i + 1][j] = dp1[i + 1][j] | dp1[i][j];
        if (0 <= j - hol[i]) dp1[i + 1][j] = dp1[i + 1][j] | dp1[i][j - hol[i]];  
        if (j + hol[i] <= shol) dp1[i + 1][j] = dp1[i + 1][j] | dp1[i][j + hol[i]];  
    }
    pt(dp0[ver.size()][y] && dp1[hol.size()][x] ? "Yes" : "No");

}

Measured memory_bytes: 156288