/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author champon
 */

#include <iostream>
#include <fstream>

#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
#define enl "\n";
using namespace std;
using ll=long long;
using ld=long double;
ll mod = ll(1e9)+7;
ll inf = ll(1e18);
template<typename T1, typename T2> ll ceill(T1 a, T2 b){ return (a+b-1)/b; }
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostream& out=cout){ out << (b ? "YES" : "NO") << endl; }
template<typename T> inline bool chmax(T &a, T b){ if(a<b){a=b; return true;} return false; }
template<typename T> inline bool chmin(T &a, T b){ if(a>b){a=b; return true;} return false; }
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){ fill((T*)array, (T*)(array+N), val); }
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};

#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP

#include <iostream>
#include <vector>
#include <map>
using namespace std;

namespace dbg {
    using ll = long long;

    class Debug {
    public:
        Debug(){}
        template<typename T>
        void vd(vector<T> vec);
        template<typename T>
        void vd2(vector<vector<T>> vec);
        template<typename T>
        void ad(T *arr, ll n);
        template<typename T, size_t N>
        void ad2(T (&arr)[N], ll n);
        template<typename T>
        void md(T mp);
    };

    template<typename T>
    void Debug::vd(vector<T> vec) {
        for (auto vv : vec) cout << vv << " ";
        cout << endl;
    }

    template<typename T>
    void Debug::vd2(vector<vector<T>> vec) {
        for (auto vv : vec) for (auto vvv : vv) cout << vvv << " ";
        cout << endl;
    }

    template<typename T>
    void Debug::ad(T *arr, ll n) {
        for (int i = 0; i <= n; i++) cout << arr[i] << " ";
        cout << endl;
    }

    template<typename T, size_t N>
    void Debug::ad2(T (&arr)[N], ll n) {
        for (int i = 0; i <= N; i++) for (int j = 0; j <= n; j++) cout << arr[i][j] << " ";
        cout << endl;
    }

    template<typename T>
    void Debug::md(T mp) {
        cout << "key : value" << endl;
        for (auto const &m : mp) cout << m.first << " : " << m.second << endl;
        cout << endl;
    }

}

#endif //INCLUDE_DEBUG_HPP

using dbg::Debug;
Debug debug;

class DFTRobot {
public:
	void solve(std::istream& in, std::ostream& out) {
	    string s;
	    int x, y;
	    in >> s >> x >> y;

	    bool lr = true;
	    vector<int> lrv, udv;
	    int n = s.length();
	    int lrcnt = 0, udcnt = 0;
	    for(int i=0; i<n; i++){
            if(s[i] == 'T'){
                if(lr) lrv.push_back(lrcnt);
                if(!lr) udv.push_back(udcnt);
                lr = !lr;
                lrcnt = 0; udcnt = 0;
                continue;
            }
            if(lr) lrcnt++;
            else udcnt++;
	    }
        if(lr) lrv.push_back(lrcnt);
        if(!lr) udv.push_back(udcnt);

//        debug.vd(lrv);
//        debug.vd(udv);

        vector<vector<bool>> dp(lrv.size()+1, vector<bool>(16005, false));

	    const int zero = 8001;
	    dp[0][zero] = true;
        for(int i=0; i<lrv.size(); i++){
            for(int j=0; j<=16001; j++){
                if (j-lrv[i] >= 0) dp[i+1][j] = dp[i+1][j] || dp[i][j-lrv[i]];
                if (j+lrv[i] <= 16001 && i != 0) dp[i+1][j] = dp[i+1][j] || dp[i][j+lrv[i]];
            }
	    }

        bool flg = dp[lrv.size()][zero+x];

        dp.assign(udv.size()+1, vector<bool>(16005, false));
	    dp[0][zero] = true;
        for(int i=0; i<udv.size(); i++){
            for(int j=0; j<=16001; j++){
                if (j-udv[i] >= 0) dp[i+1][j] = dp[i+1][j] || dp[i][j-udv[i]];
                if (j+udv[i] <= 16001) dp[i+1][j] = dp[i+1][j] || dp[i][j+udv[i]];
            }
        }

        bool res = flg && dp[udv.size()][zero+y];

        //cout << dp[lrv.size()][4001] sp dp[udv.size()][4000] << enl;
        ans(res, out);
	}
};


int main() {
	DFTRobot solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}


Measured memory_bytes: 8192