Shaass thinks a kitchen with all white floor tiles is so boring. His kitchen floor is made of n · m square tiles forming a n × m rectangle. Therefore he's decided to color some of the tiles in black so that the floor looks like a checkerboard, which is no two side-adjacent tiles should have the same color. Shaass wants to use a painter robot to color the tiles. In the beginning the robot is standing in a border tile ( x s , y s ) facing a diagonal direction (i.e. upper-left, upper-right, down-left or down-right). As the robot walks in the kitchen he paints every tile he passes even if it's painted before. Painting each tile consumes one unit of black paint. If at any moment the robot hits a wall of the kitchen he changes his direction according the reflection rules. Note that a tile gets painted when the robot enters the tile from another tile, in other words changing direction in the same tile doesn't lead to any painting. The first tile the robot is standing on, is also painted. The robot stops painting the first moment the floor is checkered. Given the dimensions of the kitchen and the position of the robot, find out the amount of paint the robot consumes before it stops painting the floor. Let's consider an examples depicted below. If the robot starts at tile number 1 (the tile (1, 1) ) of the left grid heading to down-right it'll pass tiles 1354236 and consumes 7 units of black paint on his way until he stops at tile number 6. But if it starts at tile number 1 in the right grid heading to down-right it will get stuck in a loop painting tiles 1, 2, and 3. The first line of the input contains two integers n and m , (2 ≤ n , m ≤ 10 5 ) . The second line contains two integers x s and y s (1 ≤ x s ≤ n , 1 ≤ y s ≤ m ) and the direction robot is facing initially. Direction is one of the strings: " UL " (upper-left direction), " UR " (upper-right), " DL " (down-left) or " DR " (down-right). Note, that record ( x s , y s ) denotes the tile that is located at t