Problem Statement

A robot is put at the origin in a two-dimensional plane. Initially, the robot is facing in the positive $x$-axis direction.

This robot will be given an instruction sequence $s$. $s$ consists of the following two kinds of letters, and will be executed in order from front to back.

• F : Move in the current direction by distance $1$.
• T : Turn $90$ degrees, either clockwise or counterclockwise.

The objective of the robot is to be at coordinates $(x, y)$ after all the instructions are executed. Determine whether this objective is achievable.

Constraints

• $s$ consists of F and T.
• $1 \leq |s| \leq 8$ $000$
• $x$ and $y$ are integers.
• $|x|, |y| \leq |s|$

Input

Input is given from Standard Input in the following format:

s
x y

Output

If the objective is achievable, print Yes; if it is not, print No.