#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
#define uniq(v) (v).erase(unique(all(v)), (v).end())

using namespace std;

using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { cout << p.first << ' ' << p.second; return os; }

void solve() {
  string s; cin >> s;
  int x, y; cin >> x >> y;
  int n = s.size();

  {
    bool f = false;
    rep(i, n) if (s[i] == 'T') f = true;
    if (!f) {
      if (x == n && y == 0) yes(); no();
    }
  }

  vi32 lst[2];
  {
    int cnt;
    rep(i, n) if (s[i] == 'T') { cnt = i; break; }
    x -= cnt;
    int t = 0;
    int c = 0;
    repi(i, cnt, n) {
      if (s[i] == 'F') { c++; continue; }
      lst[t].push_back(c);
      t = 1 - t, c = 0;
    }
    lst[t].push_back(c);
  }

  vector<vector<bool>> dp;

  dp = vector<vector<bool>>(2, vector<bool>(16001));
  dp[0][8000] = true;
  rep(i, lst[0].size()) {
    int p = i % 2, n = (p + 1) % 2;
    dp[n] = vector<bool>(16001);
    repc(j, 16000) {
      if (!dp[p][j]) continue;
      dp[n][j - lst[0][i]] = dp[n][j + lst[0][i]] = true;
    }
  }
  if (!dp[lst[0].size() % 2][8000 + x]) no();

  dp = vector<vector<bool>>(2, vector<bool>(16001));
  dp[0][8000] = true;
  rep(i, lst[1].size()) {
    int p = i % 2, n = (p + 1) % 2;
    dp[n] = vector<bool>(16001);
    repc(j, 16000) {
      int p = i % 2, n = (p + 1) % 2;
      if (!dp[p][j]) continue;
      dp[n][j - lst[1][i]] = dp[n][j + lst[1][i]] = true;
    }
  }
  if (!dp[lst[1].size() % 2][8000 + y]) no();
  
  yes();
}


Measured memory_bytes: 384