시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 256 MB145646044.118%

## 문제

Turtle graphics is a popular way for introducing programming to kids. It was part of the original Logo programming language developed by Wally Feurzig and Seymour Papert in 1966. It involved the Turtle, originally a robotic creature that moved around on the floor. It can be directed by typing commands into the computer. The command ‘F’ (forward) causes the turtle to move forward one step, ‘R’ (right) rotates the turtle 90 degrees clockwise while leaving it in the same place on the floor, and ‘L’ (left) rotates the turtle 90 degree anticlockwise and leaving it in the same location.

When the turtle moves forward it will leave a trail. We will represent the trail with character 'x'.

For example, the command

FFFRFFFFLFFFRFFFFF

will create the pattern below

y 0...............................
9...............................
8.........xxxxxx...............
7.........x.....................
6.........x.....................
5.....xxxxx.....................
4.....x.........................
3.....x.........................
2.....o.........................
1...............................
0...............................
0123456789012345678901234567890 x


with assumption that the initial direction of the turtle is facing to the North (the y-axis) and the initial location of the turtle is marked as 'o'. The maximum size of the drawing area is 64x64 with the origin coordinate (0, 0) at the lower left corner. You may safely assume that the path of the turtle never exceed the drawing area.

## 입력

First line of the input contains T the number of test cases (1 ≤ T ≤ 50). Each test case consists of two lines. The first line of each test case contains a pair of integer, x and y (0 ≤ x, y < 64) which represents the starting point of the path. The second line contains a string with no more than 128 characters. Each character of the string is either ‘F’, ‘R’ or ‘L’ which represents a computer command for the turtle in order.

## 출력

For each case, output in a line "Case #X: x y n" (without quotes) where X is the case number starting from 1. x and y represents the final location of the turtle and n is the number of locations in which the turtle visits more than once.

## 예제 입력 1

2
5 2
FFFRFFFFLFFFRFFFFF
2 2
FFFRFFFRFFRFFFF


## 예제 출력 1

Case #1: 14 8 0
Case #2: 1 3 1