#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using loop = int;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(loop (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(loop (i)=(a);(i)<=(n);++(i))
#define rFOR(i,a,n) for(loop (i)=(n)-1;(i)>=(a);--(i))
#define erFOR(i,a,n) for(loop (i)=(n);(i)>=(a);--(i))
#define each(i, a) for(auto &i : a)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define line cout << "------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause") //comment out this on AOJ.
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }


int main() {
    init();

    string s; cin >> s;
    int x, y; cin >> x >> y;
    x += 8000, y += 8000;

    int dir = 0, cnt = 0, sx = 0;
    VI dx, dy;
    bool f = true;
    each(i, s) {
        if (i == 'F')++cnt;
        else {
            if (f) {
                sx = cnt;
                f = false;
            }
            else {
                if (0 < cnt) {
                    if (dir == 0)dx.push_back(cnt);
                    else dy.push_back(cnt);
                }
            }
            cnt = 0;
            dir ^= 1;
        }
    }
    if (f) {
        sx = cnt;
        f = false;
    }
    else {
        if (0 < cnt) {
            if (dir == 0)dx.push_back(cnt);
            else dy.push_back(cnt);
        }
    }

    int n = dx.size(), m = dy.size();
    auto xdp = vec<bool>(n + 1, 16001);
    xdp[0][8000 + sx] = true;
    FOR(i, 0, n)eFOR(j, 0, 16000) {
        if (!xdp[i][j])continue;
        if (j + dx[i] <= 16000)xdp[i + 1][j + dx[i]] = true;
        if (0 <= j - dx[i])xdp[i + 1][j - dx[i]] = true;
    }
    auto ydp = vec<bool>(m + 1, 16001);
    ydp[0][8000] = true;
    FOR(i, 0, m)eFOR(j, 0, 16000) {
        if (!ydp[i][j])continue;
        if (j + dy[i] <= 16000)ydp[i + 1][j + dy[i]] = true;
        if (0 <= j - dy[i])ydp[i + 1][j - dy[i]] = true;
    }

    cout << (xdp[n][x] && ydp[m][y] ? "Yes" : "No") << "\n";
}


Measured memory_bytes: 8320