#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 100000000
#define INF 300000000000000000
#define MOD 1000000007
#define mod 1000000007
#define INT_MAX_ 2147483647
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[5]={-1,0,1,0,0};
int dy[5]={0,-1,0,1,0};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp1(pair<ll,ll>a,pair<ll,ll> b){
        if(a.se!=b.se)
        return a.se<b.se;
        else
        return a.fi<b.fi;
}
//----------------------------------------------------------------------
bool dp1[8001][16001],dp2[8001][16001];
//----------------------------------------------------------------------
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------  
    //ll begin_time=clock();
    //-------------------------------
    string s;cin>>s;
    int n=s.length();
    int x,y;cin>>x>>y;
    V<int>X,Y;
    bool turn=1;
    int now=0;

    for(int i=0;i<n;i++){
        if(s[i]=='F'){
            now++;
        }
        else{
            if(turn==1){
                X.pb(now);
            }
            else{
                Y.pb(now);
            }
            now=0;
            turn =1-turn;
        }
        if(i==n-1&&s[i]=='F'){
            if(turn==1){
                X.pb(now);
            }
            else{
                Y.pb(now);
            }
        }
    }

    dp1[0][8000]=1;
    dp2[0][8000]=1;
    dp1[1][X[0]+8000]=1;

    for(int i=1;i<X.size();i++){
        for(int j=-8000;j<=8000;j++){
            if(j-X[i]+8000<0){
                dp1[i+1][j+8000]=dp1[i][j+X[i]+8000];
            }
            else if(j+X[i]+8000>16000){
                dp1[i+1][j+8000]=dp1[i][j-X[i]+8000];
            }
            else
                dp1[i+1][j+8000]=(dp1[i][j-X[i]+8000]|dp1[i][j+X[i]+8000]);
        }
    }

    for(int i=0;i<Y.size();i++){
        for(int j=-8000;j<=8000;j++){
            if(j-Y[i]+8000<0){
                dp2[i+1][j+8000]=dp2[i][j+Y[i]+8000];
            }
            else if(j+Y[i]+8000>16000){
                dp2[i+1][j+8000]=dp2[i][j-Y[i]+8000];
            }
            else
                dp2[i+1][j+8000]=(dp2[i][j-Y[i]+8000]|dp2[i][j+Y[i]+8000]);
        }
    }
    //cout<<dp2[1][8002]<<endl;
    if(dp1[X.size()][x+8000]&&dp2[Y.size()][y+8000]){
        cout<<"Yes"<<endl;
    }
    else cout<<"No"<<endl;
    //-------------------------------  
    //ll end_time=clock();cout<<"time="<<end_time-begin_time<<"ms"<<endl;
    //-------------------------------
    return 0;
}
//----------------------------------------------------------------------





































Measured memory_bytes: 127232