Steps
After celebrating Petryk's birthday, Stepan took him for a walk. Petryk was full of energy—laughing, jumping, and running. As they wandered through the park, they came across a set of stairs leading to some attractions. Petryk began jumping from step to step. If he pushed off weakly, he would jump to the next step; if he pushed off strongly, he would skip a step.
Determine which step Petryk will land on if he starts on step number M of a staircase with N steps in total.
Input Data
The input consists of a single line with three pieces of information separated by spaces: the number N (1 ≤ N ≤ 1000), representing the total number of steps; the number M (0 ≤ M ≤ N), indicating the step Petryk is currently on; and a character that specifies the strength of his jump: S for a strong jump or W for a weak jump.
Output Data
The output should be a single number, representing the step number where Petryk will land after his jump.