D. J IDs
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Fast Sam and Cool Clyde decide to play a game. They have a barn that can be represented as a grid of dimensions $$$R$$$ by $$$C$$$. At the start of the game, each person stands on a specific position in the barn-grid, and they stand in different positions. They take turns moving to one of the adjacent squares (left, right, up, down) on the grid. Whoever makes the move such that they end up in the other person's square wins. Given that both people play optimally, output the result of the game.

Input

Line $$$1$$$: Two space separated integers $$$R$$$ and $$$C$$$ ($$$1 \le R, C \le 2 \times 10^3$$$).

Line $$$2$$$: Four space separated integers $$$r_s$$$, $$$c_s$$$, $$$r_c$$$, $$$c_c$$$, ($$$1 \le r_s, r_c \le R$$$; $$$1 \le c_s, c_c \le C$$$) where $$$r_s$$$ represents the row of Sam, $$$c_s$$$ represents the column of Sam, and so on.

Line $$$3$$$: A single character representing which player moves first ($$$S$$$ for Sam, $$$C$$$ for Clyde).

Output

Line $$$1$$$: One character, $$$S$$$ if Sam wins and $$$C$$$ if Clyde wins, or $$$T$$$ if there's a tie.

Example
Input
7 8
1 3 5 4
C
Output
C