#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os, const map<T,U>& mp){ os << "{"; for(auto& p : mp){ os << p << ","; } os << "}"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int,int>;
using vi = std::vector<int>;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/
int n;
int n2;

inline int index(int idx){
    return idx + n;
}

int main(){
    string s; cin >> s;
    n = s.size();
    n2 = n*2 + 5;
    int x,y; cin >> x >> y;
    int turn = 0;
    vector<int> vs[2]; // vs[0] := x軸方向に移動する, vs[1]:=y軸方向に移動
    int cnt = 0;
    rep(i,n){
        if(s[i] == 'F'){
            cnt++;
        }else{
            vs[turn].emplace_back(cnt);
            cnt=0;
            turn^=1;
        }
    }
    vs[turn].emplace_back(cnt);


    {
        int m = vs[0].size();
        vector<vector<int>> dp(m+1,vector<int>(n2,0));
        dp[1][index(vs[0][0])] = 1;
        for(int i=1;i<m;i++){
            int t = vs[0][i];
            for(int j=0;j<n2;j++){
                if(dp[i][j]){
                    if(j+t<n2) dp[i+1][j+t] = 1;
                    if(j-t>=0) dp[i+1][j-t] = 1;
                }
            }
        }

        if(!dp[m][index(x)]){
            cout << "No" << endl;
            return 0;
        }
    }
    {
        int m = vs[1].size();
        vector<vector<int>> dp(m+1,vector<int>(n2,0));
        dp[0][index(0)] = 1;
        for(int i=0;i<m;i++){
            int t = vs[1][i];
            for(int j=0;j<n2;j++){
                if(dp[i][j]){
                    if(j+t<n2) dp[i+1][j+t] = 1;
                    if(j-t>=0) dp[i+1][j-t] = 1;
                }
            }
        }

        if(!dp[m][index(y)]){
            cout << "No" << endl;
            return 0;
        }
    }
    cout << "Yes" << endl;
    return 0;
}


Measured memory_bytes: 246656