#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
#define SZ(x) ((int)(x).size())
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1 << 28;
const ll INF64 = 1ll << 55;
const int mod = 1000000007;
//const int mod = 998244353;

template <class T>inline bool chmin(T &a, const T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <class T>inline bool chmax(T &a, const T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
template <class T>inline void line_out(const vector<T> vec) {
  int n = SZ(vec);
  rep(i, n) {
    cout << vec[i];
    if(i < n-1) cout << " ";
  }
  cout << endl;
  return;
}

struct mint
{
  ll x; // typedef long long ll;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint a)
  {
    if ((x += a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator-=(const mint a)
  {
    if ((x += mod - a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator*=(const mint a)
  {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const
  {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const
  {
    mint res(*this);
    return res -= a;
  }
  mint &operator++()
  {
    if ((x += 1) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator--()
  {
    if ((x += mod - 1) >= mod)
      x -= mod;
    return *this;
  }
  mint operator*(const mint a) const
  {
    mint res(*this);
    return res *= a;
  }
  mint pow(ll t) const
  {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const
  {
    return pow(mod - 2);
  }
  mint &operator/=(const mint a)
  {
    return (*this) *= a.inv();
  }
  mint operator/(const mint a) const
  {
    mint res(*this);
    return res /= a;
  }
};

int main()
{
  string s;
  int x, y;
  cin >> s >> x >> y;
  const int N_MAX = 8003;
  vector<int> ope;
  int count = 0;
  for(auto c : s) {
    if(c == 'F') ++count;
    else {
      ope.push_back(count);
      ope.push_back(-1);
      count = 0;
    }
  }
  ope.push_back(count);
  bool xy = true, first = true;
  vector<vector<bool>> dp_x(N_MAX, vector<bool>(N_MAX*2, false)), dp_y(N_MAX, vector<bool>(N_MAX*2, false));
  dp_x[0][8000] = dp_y[0][8000] = true;
  int x_i = 0, y_i = 0;

  for(auto o : ope) {
    if(o == -1) xy = !xy;
    else if(xy) {
      ++x_i;
      rep(j, N_MAX*2) {
        if(j+o < N_MAX*2) dp_x[x_i][j+o] = dp_x[x_i][j+o] | dp_x[x_i-1][j];
        if(j-o >= 0 && !first) dp_x[x_i][j-o] = dp_x[x_i][j-o] | dp_x[x_i-1][j];
      }
    }
    else if(!xy) {
      ++y_i;
      rep(j, N_MAX*2) {
        if(j+o < N_MAX*2) dp_y[y_i][j+o] = dp_y[y_i][j+o] | dp_y[y_i-1][j];
        if(j-o >= 0) dp_y[y_i][j-o] = dp_y[y_i][j-o] | dp_y[y_i-1][j];
      }
    }
    if(first) first = !first;
  }
  if(dp_x[x_i][x+8000] && dp_y[y_i][y+8000]) cout << "Yes" << endl;
  else cout << "No" << endl;
}



Measured memory_bytes: 35412