#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int,int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
template<class T>bool chmax(T &a, const T &b) {if(a<b){a = b; return 1;} return 0; };
template<class T>bool chmin(T &a, const T &b) {if(a>b){a = b; return 1;} return 0; };
inline void IN(void){return;}
template <typename First, typename... Rest> void IN(First& first, Rest&... rest){cin >> first;IN(rest...);return;}
inline void OUT(void){cout << "\n";return;}
template <typename First, typename... Rest> void OUT(First first, Rest... rest){cout << first << " ";OUT(rest...);return;}
const double EPS = 1e-9;
const int mod = 1e9+7;
long long lcm(ll a, ll b){return a * b / __gcd(a,b);}
struct IoSetup { IoSetup() {
    cin.tie(nullptr);ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
} } iosetup;
template< int mod > struct ModInt {
    int x; ModInt() : x(0) {}
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}
    ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}
    ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}
    ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); }return ModInt(u);}
    ModInt pow(int64_t n) const {ModInt ret(1), mul(x); while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}
    friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x;}
    friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); }
    static int get_mod() { return mod; }
}; using modint = ModInt< mod >;
const string YES = "Yes";
const string NO = "No";

const pii dir[4] = {mp(1,0), mp(0,1), mp(-1, 0), mp(0, -1)};

void solve(std::string s, int x, int y){
    int N = s.size();
    x += 8005;
    y += 8005;
    bitset<16010> dpx[2]{};
    bitset<16010> dpy[2]{};
    dpx[0][8005] = true;
    dpy[0][8005] = true;
    bool flag = 1;
    rep(i, 0, N){
        if(s[i] == 'F'){
            if(flag){ // x方向に進んでる
                dpx[0] = (dpx[0] << 1);
                dpx[1] = (dpx[1] >> 1);
            }else{
                dpy[0] = (dpy[0] << 1);
                dpy[1] = (dpy[1] >> 1);
            }
        }else{
            if(flag){
                dpy[0] |= dpy[1];
                dpy[1] |= dpy[0];
            }else{
                dpx[0] |= dpx[1];
                dpx[1] |= dpx[0];
            }
            flag = !flag;
        }
    }
    dpx[0] |= dpx[1];
    dpy[0] |= dpy[1];
    //rep(i, 0, 10) cerr <<i - 5 << " " <<  dpx[0][8000 + i] << endl;
    //rep(i, 0, 10) cerr << i - 5 << " " <<  dpy[0][8000 + i] << endl;
    if(dpx[0][x] && dpy[0][y]) cout << YES << endl;
    else cout << NO << endl;
}

// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
int main(){
    iosetup;
    string s;
    cin >> s;
    int x, y;
    IN(x, y);
    solve(s, x, y);
    return 0;
}

/*     int N = s.size();
    int idx = 0;
    pii point = make_pair(0, 0);
    rep(i, 0, N){
        if(s[i] == 'F'){
            point.first += dir[idx].first;
            point.second += dir[idx].second;
        }else{
            if(idx % 2 == 0){
                if(point.second >= y) idx = 3;
                else idx = 1; 
            }else{
                if(point.first >= x) idx = 2;
                else idx = 0;
            }
        }
    }
    if(point.first == x && point.second == y) cout << YES << endl;
    else cout << NO << endl; */

Measured memory_bytes: 256