output_description: If the objective is achievable, print `Yes`; if it is not, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      s
      x y
attempt: hoge
  
problem_description: 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.
samples: [{"input": "FTFFTFFF\n    4 2", "output": "Yes\n    \n\nThe objective can be achieved by, for example, turning counterclockwise in the\nfirst `T` and turning clockwise in the second `T`.\n\n* * *"}, {"input": "FTFFTFFF\n    -2 -2", "output": "Yes\n    \n\nThe objective can be achieved by, for example, turning clockwise in the first\n`T` and turning clockwise in the second `T`.\n\n* * *"}, {"input": "FF\n    1 0", "output": "No\n    \n\n* * *"}, {"input": "TF\n    1 0", "output": "No\n    \n\n* * *"}, {"input": "FFTTFF\n    0 0", "output": "Yes\n    \n\nThe objective can be achieved by, for example, turning counterclockwise in the\nfirst `T` and turning counterclockwise in the second `T`.\n\n* * *"}, {"input": "TTTT\n    1 0", "output": "No"}]