#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
using namespace std; using ll = long long; using ld = long double;  using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using vpll = vector<pll>;
const ld PI = 3.1415926535897932;
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define rep1(n) for(ll i=0;i<n;++i)
#define rep2(i,n) for(ll i=0;i<n;++i)
#define rep3(i,a,b) for(ll i=a;i<b;++i)
#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define mp make_pair
#define mt make_tuple
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
void in() {}
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
	cerr << " " << h;
	if (sizeof...(t) > 0) cerr << " :";
	debug_out(t...);
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> vec) {
	for (size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	return os;
}
ll ctoi(char c) {
	switch (c) {
	case '0': return 0; case '1': return 1; case '2': return 2;
	case '3': return 3; case '4': return 4; case '5': return 5;
	case '6': return 6; case '7': return 7; case '8': return 8;
	case '9': return 9;  default: return 0;
	}
}
void vout(vl V) {
	for (ll i = 0; i < V.size(); i++) cout << V[i] << " ";
	cout << endl;
}
bool pairCompare(const pll firstElof, pll secondElof)
{
	return firstElof.first > secondElof.first;
}
//**Snippetリスト**//
//rep, vin, all, iteLoop//
//bitSearch, bitList, nod, gcdlcm, isPrime, primeFactorize, Npow, divisor, modinv, dfs, bfs, eratos//
//dijkstra, WarshallFloyd, BellmanFord, UnionFind, COM, digitDP ,RMQ//
ll i, j, k, l; ll N, M, K, H, W, L, X, Y, Z, R, Q;
ll MOD = 1000000007; ll INF = 1LL << 62; ll ans = 0; ll z = 0, o = 1;
vl flag, color, D; vll path; ll pre = 0;
int main() {
	string S;
	cin >> S;
	ll x, y;
	cin >> x >> y;
	vl X, Y;
	ll count = 0;
	ll mode = 0;
	ll firstLimit = 0;
	N = S.length();
	if (S[0] == 'F') firstLimit = 1;
	for (i = 0; i < N; i++) {
		if (S[i] == 'F') count++;
		else {
			if (mode == 0 && count > 0) X.push_back(count);
			else if(mode == 1 && count > 0) Y.push_back(count);
			count = 0; (mode+=1) %= 2;
		}
	}
	if (mode == 0 && count > 0) X.push_back(count);
	else if (mode == 1 && count > 0) Y.push_back(count);
	//debug(X, Y);
	ll P = X.size(); ll Q = Y.size();
	vll dp1(P+1,vl(16001,0)), dp2(Q+1,vl(16001,0));
	dp1[0][8000] = 1; dp2[0][8000] = 1;
	for (i = 0; i < P; i++) {
		for (j = 0; j <= 16000; j++) {
			if (dp1[i][j] == 1) {
				if (j - X[i] >= 0 && (i!=0 || !firstLimit )) dp1[i+1][j - X[i]] = 1;
				if (j + X[i] <= 16000) dp1[i+1][j + X[i]] = 1;
			}
		}
	}
	for (i = 0; i < Q; i++) {
		for (j = 0; j <= 16000; j++) {
			if (dp2[i][j] == 1) {
				if (j - Y[i] >= 0) dp2[i + 1][j - Y[i]] = 1;
				if (j + Y[i] <= 16000) dp2[i+1][j + Y[i]] = 1;
			}
		}
	}
	if (dp1[P][x + 8000] && dp2[Q][y + 8000]) cout << "Yes";
	else cout << "No";
}

Measured memory_bytes: 500864