/*
これを入れて実行
g++ code.cpp
./a.out
 */
 
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>

#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
 
using namespace std;
typedef long long ll;
typedef long double ld;
 
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
 
const long long INF = 1LL << 62;
const ll MOD = 1e9 + 7;
 
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){
    return f.second > s.second;
}
 
ll gcd(ll a, ll b){
	if (b == 0)return a;
	return gcd(b, a % b);
}
 
ll lcm(ll a, ll b){
    return a / gcd(a, b) * b;
}
 
ll nCr(ll n, ll r){
    if(r == 0 || r == n){
        return 1;
    } else if(r == 1){
        return n;
    }
    return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
 
ll nPr(ll n, ll r){
    r = n - r;
    ll ret = 1;
    for (ll i = n; i >= r + 1; i--) ret *= i;
    return ret;
}
 
//-----------------------ここから-----------
vector<int> xmove;
vector<int> ymove;
int memo[8001][16001];
bool f = false;
int recx(int i, int j){
    if(i == xmove.size() && j == 8000) return 1;
    if(i == xmove.size()) return 0;
    if(memo[i][j] != -1) return memo[i][j];
    //cout << i << " " << j << endl;
    int res = 0;
    if(i == 0 && f){
        if(recx(i + 1, j - xmove[i]) == 1){
            res = 1;
        }
    } else {    
        if(recx(i + 1, j + xmove[i]) == 1 || recx(i + 1, j - xmove[i]) == 1){
            res = 1;
        }
    }
    return memo[i][j] = res;
}
int recy(int i, int j){
    if(i == ymove.size() && j == 8000) return 1;
    if(i == ymove.size()) return 0;
    if(memo[i][j] != -1) return memo[i][j];
    int res = 0;
    if(recy(i + 1, j + ymove[i]) == 1 || recy(i + 1, j - ymove[i]) == 1){
        res = 1;
    }

    return memo[i][j] = res;
}
int main(void){
    string s;
    cin >> s;
    int x, y;
    cin >> x >> y;


    int cnt = 0;
    bool xy = false;
    bool fi = true;
    rep(i, s.size()){
        if(s[i] == 'F'){
            cnt++;
        } else {
            if(cnt > 0 && fi){
                f = true;
            }
            fi = false;
            if(xy){
                if(cnt != 0) ymove.push_back(cnt);
                cnt = 0;
                xy = !xy;
            } else {
                if(cnt != 0)xmove.push_back(cnt);
                cnt = 0;
                xy = !xy;
            }
        }
    }
    if(cnt > 0 && fi){
        f = true;
    }
    fi = false;
    if(xy){
        ymove.push_back(cnt);
        cnt = 0;
        xy = !xy;
    } else {
        xmove.push_back(cnt);
        cnt = 0;
        xy = !xy;
    }

    rep(i, 8001){
        rep(j, 16001){
            memo[i][j] =  -1;
        }
    }
    int ans1 = recx(0, 8000 + x);
    rep(i, 8001){
        rep(j, 16001){
            memo[i][j] =  -1;
        }
    }
    int ans2 = recy(0, 8000 + y);
    if(ans1 == 1 && ans2 == 1){
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
}

Measured memory_bytes: 500480