Здравейте на тази задача ми гърми тест номер 4 (Runtime error). Какво ли не пробвах и не гърми. Единствения начин по който се сетих в който ще гръмне е ако се въведе String в началото а не числа. Но това ми се струва абсурдно. Моля ако някой може да погледне кода: 
https://pastebin.com/Zsjvbu5i 

Условиета на задачата (Матрица)

You will be given N and M – integers, indicating the field's dimensions, shown on the secret map. On the next N lines, you will receive the rows of the field. You will be placed in a random position, marked with the letter 'Y'. On random positions, there will be trees marked with the letter 'T'. The treasure is marked with the letter 'X'. All of the empty positions will be marked with '-'.
You will receive a few lines with commands representing which direction you need to move. The possible directions are up, down, right, and left.
If you go out of the field, you need to stay in the last possible position inside the field.
If you step on a tree (position marked with 'T'), go one step back to the direction you came from (not make a move).
If the given command is "Finish" you need to check the position you are standing on. If it is marked with 'X' this means you have found the treasure, and you have to print the following message: "I've found the treasure!". Then print the correct directions you went to in order to find the treasure.
Otherwise, print: "The map is fake!".
Input
⦁    On the first line, you'll receive the field dimensions in the format: "N M", where N is the number of rows, and M is the number of columns. They'll be separated by a single space (" ").
⦁    On the next N lines, you will receive a string representing the respective row of the field. The positions in every string will be separated by a single space (" ").
⦁    On the next few lines, until you receive the command "Finish", you will be given directions (up, down, right, left). 

Output
⦁    There are two types of output:
⦁    If you have found the treasure (the last step is on a position marked with 'X') print the following output: "I've found the treasure!".
On the next line, print the correct directions you went to find the treasure (do not include the directions that made you go out of the field or step on a tree). The directions must be separated by a comma and space (", "). It should look like this:
"The right path is {direction1}, {direction2}, …".
⦁    If you have not found the treasure, print the following message: "The map is fake!".

Constraints
⦁    The field size will be a 32-bit integer in the range [0 … 2 147 483 647].
⦁    The field will always have only one 'X' and only one 'Y'.
⦁    If the steps are invalid, do not include them in the result.

Input 1 
5 8
- - - T - - - T
- X - T T - - -
- - - - - - T -
- - Y - T - - T
- - - T - - - -
up
up
left
Finish

Output 1 

I've found the treasure!
The right path is up, up, left

==========================

Input 2

4 7
T - - T - T T
- - - - - X -
T - - - - - -
Y - - - - - T
left
right
right
up
Finish

Output 2

The map is fake!