#include <bits/stdc++.h>  // ver2.2.8
#define int long long
#define endl "\n"
#define ALL(v) (v).begin(),(v).end()
#define COUNT(a,k) upper_bound(ALL(a),k)-lower_bound(ALL(a),k)
#define BIGGER(a,k) a.end()-upper_bound(ALL(a),k)
#define SMALLER(a,k) lower_bound(ALL(a),k)-a.begin()
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Pii pair<int,int>
#define VPii vector<Pii>
#define Tiii tuple<int,int,int>
#define PQi priority_queue<int>
#define PQir priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define itos to_string
#define stoi stoll
#define FI first
#define SE second
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define cyes cout<<"yes"<<endl
#define cno cout<<"no"<<endl
#define _ <<' '<<
#define sortr(v) sort(v,greater<>())
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define repreq(i,a,b) for(int i=a;i>=b;i--)
#define leng(n) (int)(log10(n)+1)
#define dem(a,b) ((a+b-1)/(b))
#define Vin(a) rep(iI,0,a.size())cin>>a[iI]
#define Vout(a) rep(lZ,0,a.size()-1)cout<<a[lZ]<<' ';cout<<a.back()<<endl
#define VVout(a) rep(lY,0,a.size()){if(!a[lY].empty()){Vout(a[lY]);}else cout<<endl;}
#define VPout(a) rep(lX,0,a.size())cout<<a[lX].FI<<' '<<a[lX].SE<<endl
#define Verr(a) rep(iZ,0,a.size()-1)cerr<<a[iZ]<<' ';cerr<<a.back()<<endl
#define VVerr(a) rep(iY,0,a.size()){if(!a[iY].empty()){Verr(a[iY]);}else cerr<<'.'<<endl;}
#define VPerr(a) rep(iX,0,a.size())cerr<<a[iX].FI<<' '<<a[iX].SE<<endl
#define INF 3000000000000000000  //  3.0*10^18(MAXの1/3くらい)
#define MAX LLONG_MAX
#define MOD 1000000007  //  10^9 + 7
using namespace std;

int gcd(int a,int b){return b?gcd(b,a%b):a;}  //  最大公約数gcd
int lcm(int a,int b){return a/gcd(a,b)*b;}  //  最小公倍数lcm
void press(auto &v){v.erase(unique(ALL(v)),v.end());}  //  圧縮
int mypow(int x, int n, int m){  //  累乗x^n(mod m)  O(log(n))
if(n==0)return 1;if(n%2==0)return mypow(x*x%m,n/2,m);else return x*mypow(x,n-1,m)%m;}



signed main() {
  cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(12);
  string s;
  cin >> s;
  int qw,er,ty,ui,st;
  qw = 0;
  st = 0;
  int n = s.size();
  
  map<int,int> tatem,yokom,memo;
  
  rep(i,0,n){
    if(s[i]=='T') {
      st = i;
      break;
    }
    
    if(i==n-1){
      qw = s.size();
      cin >> er >> ty;
      if(er == qw && ty == 0) cYes;
      else cNo;
      return 0;
    }
    
  }
  int nowd = 0,now = 0;  // 1たて0よこ
  cerr << st << endl;
  Vi tate(1,0),yoko(1,0);
  
  rep(i,st,n){
    if(s[i]=='T') {
      if(now > 0 && nowd==0) yoko.pb(now);
      if(now > 0 && nowd==1) tate.pb(now); 
      now = 0;
      nowd = (nowd+1)%2;
    }
    else {
      now++;
    }
  }
  if(now > 0 && nowd==0) yoko.pb(now);
  if(now > 0 && nowd==1) tate.pb(now); 
  Verr(tate);Verr(yoko);
  
  yokom[st]++;
  tatem[0]++;
  
  rep(i,0,yoko.size()){
    memo = yokom;
    yokom.clear();
    for (auto p : memo ) {
      auto k = p.first;
      auto v = p.second;
      yokom[k+yoko[i]]++;
      yokom[k-yoko[i]]++;
    }
  }
  rep(i,0,tate.size()){
    memo = tatem;
    tatem.clear();
    for (auto p : memo ) {
      auto k = p.first;
      auto v = p.second;
      tatem[k+tate[i]]++;
      tatem[k-tate[i]]++;
    }
  }
  
  int x,y;
  cin >> x >> y;
  bool ok1=false,ok2=false;
  for (auto p : yokom ) {
    auto k = p.first;
    auto v = p.second;
    if(k == x) {ok1 = true;break;}
  }
  for (auto p : tatem ) {
    auto k = p.first;
    auto v = p.second;
    if(k == y) {ok2 = true;break;}
  }
  
  for (auto p : yokom ) {
   auto k = p.first;
   auto v = p.second;
   cerr << k << " => " << v << endl;
 }
  
  if(ok1&&ok2) cYes;
  else cNo;
  return 0;
}

Measured memory_bytes: 1024