Joro

        function Solve(args) {
            var size = args[0].split(' ');
            var rowCount = parseInt(size[0]);
            var colCount = parseInt(size[1]);
            var jumpsCount = parseInt(size[2]);
            var positionArray = args[1].split(' ');
            var positionRow = parseInt(positionArray[0]);
            var positionCol = parseInt(positionArray[1]);
            var field = [];
            var number = 1;
            var visited = [];
            for (var i = 0; i < rowCount; i++) {
                var row = [];
                var visitedRow = [];
                for (var j = 0; j < colCount; j++) {
                    visitedRow.push(0);
                    row.push(number);
                    number++;
                }
                field.push(row);
                visited.push(visitedRow);
            }
            var i = 2;
            var jumps = [];
            while (args[i]) {
                var lineArray = args[i].split(' ');
                var jump = [];
                jump.push(parseInt(lineArray[0]));
                jump.push(parseInt(lineArray[1]));
                jumps.push(jump);
                i++;
            }
            var count = 0;
            var jumpsC = -1;
            var sumOfNumbers = 0;
            var caught = false;
            while (positionRow >= 0 && positionCol >= 0 && positionRow < rowCount && positionCol < colCount && !caught) {
                sumOfNumbers += field[positionRow][positionCol];
                jumpsC = jumpsC + 1;
                if (visited[positionRow][positionCol] == 1) {
                    caught = true;

                } else {
                    visited[positionRow][positionCol] = 1;
                }

                if (jumps[count]) {
                } else {
                    count = 0;
                }
                positionRow += jumps[count][0];
                positionCol += jumps[count][1];
                count++;
            }
            if (caught) {
                return 'caught ' + jumpsC;
            } else {
                return 'escaped ' + sumOfNumbers;
            }
        }