Warehouse Robot

An automated warehouse uses a grid-based floor plan to guide delivery robots. The robot starts at the top-left corner (row $0$, column $0$) and receives a sequence of move commands. Each cell is either open (.) or blocked by a shelf (#).

The robot processes each command in order:
- R: move one cell right (column $+1$)
- L: move one cell left (column $-1$)
- D: move one cell down (row $+1$)
- U: move one cell up (row $-1$)

If a move would take the robot off the grid or into a shelf (#), the robot ignores that command and stays in place.

After processing all commands, output the robot's final position and how many commands were successfully executed (not ignored).

Input:
- Line 1: two integers $R$ and $C$, the number of rows and columns
- Next $R$ lines: the grid, each line containing $C$ characters (. or #)
- Last line: a string of move commands (R, L, D, U)

Output:
- Line 1: two integers, the final row and column ($0$-indexed), separated by a space
- Line 2: the number of successfully executed commands

3 4
....
.#..
....
RRDDLLD

2 0
6