#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <iomanip>

using namespace std;

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N-1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N-1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;

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; }
struct mll {
	static ll MOD;
	ll val;
	mll(ll v = 0) : val(v % MOD) { if (val < 0) val += MOD; }
	mll operator - () const { return -val; }
	mll operator + (const mll &b) const { return val + b.val; }
	mll operator - (const mll &b) const { return val - b.val; }
	mll operator * (const mll &b) const { return val * b.val; }
	mll operator / (const mll &b) const { return mll(*this) /= b; }
	mll operator + (ll b) const { return *this + mll(b); }
	mll operator - (ll b) const { return *this - mll(b); }
	mll operator * (ll b) const { return *this * mll(b); }
	friend mll operator + (ll a, const mll &b) { return b + a; }
	friend mll operator - (ll a, const mll &b) { return -b + a; }
	friend mll operator * (ll a, const mll &b) { return b * a; }
	mll &operator += (const mll &b) { val = (val + b.val) % MOD; return *this; }
	mll &operator -= (const mll &b) { val = (val + MOD - b.val) % MOD; return *this; }
	mll &operator *= (const mll &b) { val = (val*b.val) % MOD; return *this; }
	mll &operator /= (const mll &b) {
		ll c = b.val, d = MOD, u = 1, v = 0;
		while (d) {
			ll t = c / d;
			c -= t * d; swap(c, d);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	mll &operator += (ll b) { return *this += mll(b); }
	mll &operator -= (ll b) { return *this -= mll(b); }
	mll &operator *= (ll b) { return *this *= mll(b); }
	mll &operator /= (ll b) { return *this /= mll(b); }
	bool operator == (const mll &b) { return val == b.val; }
	bool operator != (const mll &b) { return val != b.val; }
	bool operator == (ll b) { return *this == mll(b); }
	bool operator != (ll b) { return *this != mll(b); }
	friend bool operator == (ll a, const mll &b) { return mll(a) == b.val; }
	friend bool operator != (ll a, const mll &b) { return mll(a) != b.val; }
	friend ostream &operator << (ostream &os, const mll &a) { return os << a.val; }
	friend istream &operator >> (istream &is, mll &a) { return is >> a.val; }
	static mll Combination(ll a, ll b) {
		chmin(b, a - b);
		if (b < 0) return mll(0);
		mll c = 1;
		rep(i, b) c *= a - i;
		rep(i, b) c /= i + 1;
		return c;
	}
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;

struct Fast {
	Fast() {
		cin.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
	}
} fast; //cin,cout高速化のおまじない＋桁数指定

ll mll::MOD = (ll)(1e9 + 7);// 998244353ll;

bool solve(const ll goal, const vll &move) {
	/*
	if (move.size() == 0) {
		return goal == 0 ? true : false;
	}

	ll goalAbs = abs(goal);
	vector<vector<bool>> dp(move.size() + 1, vector<bool>(goalAbs * 2 + 1, false));
	dp[0][goalAbs] = true;

	rep(i, (ll)move.size()) {
		rep(j, goalAbs * 2 + 1) {
			if (dp[i][j] == true) {
				ll next = j + move[i];
				if (next < (ll)move.size()) {
					dp[i + 1][next] = true;
				}

				next = j - move[i];
				if (next >= 0) {
					dp[i + 1][next] = true;
				}
			}
		}
	}

	return dp[move.size()][goal + goalAbs];
	*/

	ll goalAbs = abs(goal);

	ll sum = 0;
	for (auto dist : move) {
		sum += dist;
	}

	if (sum == goalAbs) {
		return true;
	}

	if (sum < goalAbs) {
		return false;
	}

	ll sub = sum - goalAbs;

	if (sub % 2 > 0) {
		return false;
	}

	sub /= 2;

	vector<vector<bool>> dp(move.size(), vector<bool>(sub + 1, false));
	dp[0][0] = true;
	if (move[0] <= sub) {
		dp[0][move[0]] = true;
	}

	rep(i, (ll)move.size() - 1) {
		rep(j, sub + 1) {
			if (dp[i][j] == true) {
				dp[i + 1][j] = true;
				ll next = j + move[i + 1];
				if (next <= sub) {
					dp[i + 1][next] = true;
				}
			}
		}
	}

	eprintf("\ndp\n");
	rep(i, (ll)move.size()) {
		rep(j, sub + 1) {
			eprintf("%d ", dp[i][j] ? 1 : 0);
		}
		eprintf("\n");
	}

	return dp[move.size() - 1][sub];
}

int main() {
	string S;
	cin >> S;
	ll len_S = S.size();
	ll A;
	cin >> A;
	ll B;
	cin >> B;

	vll Xlist(0);
	vll Ylist(0);

	ll countT = 0;
	ll countF = 0;
	ll biasX = 0;
	rep(i, len_S) {
		if (S[i] == 'F') {
			countF++;
		}
		else if (S[i] == 'T') {
			if (countF > 0) {
				if (countT == 0) {
					//最初のTまでの移動はX軸正方向で固定
					biasX = countF;
				}
				else if (countT % 2 == 0) {
					Xlist.push_back(countF);
				}
				else {
					Ylist.push_back(countF);
				}
			}

			countT++;
			countF = 0;
		}
	}

	if (countF > 0) {
		if (countT == 0) {
			//最初のTまでの移動はX軸正方向で固定
			biasX = countF;
		}
		else if (countT % 2 == 0) {
			Xlist.push_back(countF);
		}
		else {
			Ylist.push_back(countF);
		}
	}

	//バイアス込み初期位置から目標位置までの距離
	ll X = A - biasX;
	ll Y = B;
	eprintf("X:%lld Y:%lld\n", X, Y);
	eprintf("Xlist:");
	rep(i, (ll)Xlist.size()) {
		eprintf("%lld ", Xlist[i]);
	}
	eprintf("Ylist:");
	rep(i, (ll)Ylist.size()) {
		eprintf("%lld ", Ylist[i]);
	}

	bool result = solve(X, Xlist) & solve(Y, Ylist);

	if (result == true) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}

	return 0;
}


Measured memory_bytes: 640