// Original C++ solution (slower):
#include <bits/stdc++.h>

using namespace std;



#define fs first

#define sc second

#define pb emplace_back

#define mp make_pair

#define all(v) v.begin(), v.end()

#define rall(v) v.rbegin(), v.rend()



const int32_t inf = 1001001001;

const int64_t infll = 1001001001001001001ll;

const int dx[] = {0, -1, 1, 0, -1, 1, -1, 1}, dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};



template <typename T> using vector2d = vector<vector<T>>;



// clang-format off

template <typename T> void sort(vector<T> &v) { sort(all(v)); }

// ostream &operator<<(ostream &os, __int128_t value) { if (ostream::sentry(os)) { __uint128_t tmp = value < 0 ? -value : value; char buffer[64]; char *d = end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = end(buffer) - d; if (os.rdbuf()->sputn(d, len) != len) { os.setstate(ios_base::badbit); }} return os; }

// istream &operator>>(istream &is, __int128_t &value) { string in; is >> in; value = 0; for (const char &c : in) { if ('0' <= c && c <= '9') value = 10 * value + (c - '0'); } if (in[0] == '-') value *= -1; return is; }

// ostream &operator<<(ostream &os, __uint128_t value) { if (ostream::sentry(os)) { char buffer[64]; char *d = end(buffer); do { --d; *d = "0123456789"[value % 10]; value /= 10; } while (value != 0); int len = end(buffer) - d; if (os.rdbuf()->sputn(d, len) != len) { os.setstate(ios_base::badbit); }} return os; }

// istream &operator>>(istream &is, __uint128_t &value) { string in; is >> in; value = 0; for (const char &c : in) { if ('0' <= c && c <= '9') value = 10 * value + (c - '0'); } return is; }

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { os << v[0]; for (int i = 1; i < v.size(); ++i) os << " " << v[i]; return os; }

template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }

template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << p.fs << " " << p.sc; return os; }

template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.fs >> p.sc; return is; }



struct IoSetup { IoSetup(){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup;



inline int64_t in() { int64_t x = 0; cin >> x; return x; }

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

// clang-format on



string s;

// int x, y;

int x[2];



vector<int> a[2];

vector<vector<int>> dp;



int dfs(int i, int t, int idx) {

  if (i == a[idx].size()) {

    return (t - 8000) == x[idx];

  }

  if (~dp[i][t]) return dp[i][t];

  return dp[i][t] = dfs(i + 1, t + a[idx][i], idx) | dfs(i + 1, t - a[idx][i], idx);

}



signed main(int argc, char *argv[]) {

  cin >> s >> x[0] >> x[1];



  s += "T";

  int cnt = 0, idx = 0;

  for (int i = 0; i < s.size(); ++i) {

    if (s[i] == 'T') {

      a[idx & 1].push_back(cnt);

      cnt = 0;

      idx++;

    } else {

      cnt++;

    }

  }



  dp.assign(a[0].size(), vector<int>(16010, -1));

  if (dfs(1, a[0][0] + 8000, 0)) {

    dp.assign(a[1].size(), vector<int>(16010, -1));

    if (dfs(0, 8000, 1)) {

      cout << "Yes" << endl;

      return 0;

    }

  }

  cout << "No" << endl;

}


// Optimized solution to the same problem (faster):
#include <bits/stdc++.h>

using namespace std;



#define fs first

#define sc second

#define pb emplace_back

#define mp make_pair

#define all(v) v.begin(), v.end()

#define rall(v) v.rbegin(), v.rend()



const int32_t inf = 1001001001;

const int64_t infll = 1001001001001001001ll;

const int dx[] = {0, -1, 1, 0, -1, 1, -1, 1}, dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};



template <typename T> using vector2d = vector<vector<T>>;



// clang-format off

template <typename T> void sort(vector<T> &v) { sort(all(v)); }

// ostream &operator<<(ostream &os, __int128_t value) { if (ostream::sentry(os)) { __uint128_t tmp = value < 0 ? -value : value; char buffer[64]; char *d = end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = end(buffer) - d; if (os.rdbuf()->sputn(d, len) != len) { os.setstate(ios_base::badbit); }} return os; }

// istream &operator>>(istream &is, __int128_t &value) { string in; is >> in; value = 0; for (const char &c : in) { if ('0' <= c && c <= '9') value = 10 * value + (c - '0'); } if (in[0] == '-') value *= -1; return is; }

// ostream &operator<<(ostream &os, __uint128_t value) { if (ostream::sentry(os)) { char buffer[64]; char *d = end(buffer); do { --d; *d = "0123456789"[value % 10]; value /= 10; } while (value != 0); int len = end(buffer) - d; if (os.rdbuf()->sputn(d, len) != len) { os.setstate(ios_base::badbit); }} return os; }

// istream &operator>>(istream &is, __uint128_t &value) { string in; is >> in; value = 0; for (const char &c : in) { if ('0' <= c && c <= '9') value = 10 * value + (c - '0'); } return is; }

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { os << v[0]; for (int i = 1; i < v.size(); ++i) os << " " << v[i]; return os; }

template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }

template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << p.fs << " " << p.sc; return os; }

template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.fs >> p.sc; return is; }



struct IoSetup { IoSetup(){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup;



inline int64_t in() { int64_t x = 0; cin >> x; return x; }

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

// clang-format on



signed main(int argc, char *argv[]) {

  string s;

  cin >> s;



  int x = in(), y = in();



  s += "T";

  vector<int> a[2];

  int cnt = 0, idx = 0;

  for (int i = 0; i < s.size(); ++i) {

    if (s[i] == 'T') {

      a[idx & 1].pb(cnt);

      cnt = 0;

      idx++;

    } else {

      cnt++;

    }

  }



  bitset<16010> latte, malta;

  latte[a[0][0] + 8000] = malta[8000] = true;



  for (int i = 1; i < a[0].size(); ++i) {

    latte = (latte << a[0][i]) | (latte >> a[0][i]);

  }

  for (int i = 0; i < a[1].size(); ++i) {

    malta = (malta << a[1][i]) | (malta >> a[1][i]);

  }



  if (latte[x + 8000] && malta[y + 8000]) {

    puts("Yes");

  } else {

    puts("No");

  }

}


// Fastest known solution for this problem: