#include <bits/stdc++.h>

using namespace std;

#define DUMP(x) std::cerr << (#x) << " = " << (x) << "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define ALL(r) r.begin(), r.end()
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")
#define No puts("No")
#define IMP puts("IMPOSSIBLE")
#define Imp puts("Impossible")
#define imp puts("impossible")
#define M1 puts("-1")
#define pb push_back

template <typename T>
ostream &operator<<(ostream &os, vector<T> &v)
{
    os << "{";
    rep(i, v.size()) os << v[i] << (i == (int)v.size() - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T>
T dup(T x, T y)
{
    return (x + y - 1) / y;
};
template <typename A, size_t N, typename T>
inline void arrayFill(A (&array)[N], const T &val) { std::fill((T *)array, (T *)(array + N), val); }
struct in
{
    size_t n;
    in() = default;
    in(size_t n) : n(n){};
    template <typename T>
    operator T()
    {
        T ret;
        cin >> ret;
        return ret;
    }
    template <typename T>
    operator vector<T>()
    {
        vector<T> ret(n);
        for (auto &x : ret)
            cin >> x;
        return ret;
    }
};

using ll = int64_t;
using vint = vector<int32_t>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pint = pair<int32_t, int32_t>;
using pll = pair<ll, ll>;
using setint = set<int32_t>;
using setstr = set<string>;
using qint = queue<int32_t>;
using qpint = queue<pint>;

constexpr std::int32_t INF = 1001001001;
constexpr std::int64_t LINF = 1001001001001001001;

template <typename T>
vector<pair<T, ll>> rle(vector<T> v)
{
    vector<pair<T, ll>> ret;
    ret.reserve(v.size() / 2);
    for (const auto x : v)
    {
        if (ret.empty() || ret.back().first != x)
        {
            ret.emplace_back(x, 1);
        }
        else
        {
            ++ret.back().second;
        }
    }
    return ret;
}
vector<pair<char, ll>> rle(string s)
{
    vector<pair<char, ll>> ret;
    ret.reserve(s.size() / 2);
    for (const auto c : s)
    {
        if (ret.empty() || ret.back().first != c)
        {
            ret.emplace_back(c, 1);
        }
        else
        {
            ++ret.back().second;
        }
    }
    return ret;
}
bool dpx[3000][20000];
bool dpy[3000][20000];

void Main()
{
    arrayFill(dpx, false);
    arrayFill(dpy, false);

    string s = in();
    int x = in();
    int y = in();
    auto v = rle(s);

    vint vx;
    vint vy;
    bool is_vx = true;
    bool can_n = false;
    rep(i, v.size())
    {
        if (v[i].first == 'T')
        {
            if (vx.empty())
            {
                can_n = true;
            }
            if (v[i].second % 2 == 1)
            {
                is_vx = !is_vx;
            }
        }
        else
        {
            if (is_vx)
            {
                vx.pb(v[i].second);
            }
            else
            {
                vy.pb(v[i].second);
            }
        }
    }

    constexpr int ZERO = 8005;

    dpx[0][ZERO] = true;
    dpy[0][ZERO] = true;

    rep(i, vx.size())
    {
        rep(j, 2 * 8005)
        {
            if (!dpx[i][j])
                continue;
            dpx[i + 1][j + vx[i]] = dpx[i][j];
            if (i == 0 && !can_n)
                continue;
            dpx[i + 1][j - vx[i]] = dpx[i][j];
        }
    }
    rep(i, vy.size())
    {
        rep(j, 2 * 8005)
        {
            if (!dpy[i][j])
                continue;
            dpy[i + 1][j + vy[i]] = dpy[i][j];
            dpy[i + 1][j - vy[i]] = dpy[i][j];
        }
    }

    if (dpx[vx.size()][ZERO + x] && dpy[vy.size()][ZERO + y])
        Yes;
    else
        No;
}

int main()
{
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(15);
    Main();
    return 0;
}


Measured memory_bytes: 117632