Please solve the following in Java only

Lucy loves to play the Hop, Skip and Jump

game. Given an N$*$M matrix and starting from

cell $(1,1),$ her challenge is to hop in an anti$-$

clockwise direction and skip alternate cells. The

goal is to find out the last cell she would hop

onto.

Write an algorithm to find the last cell Lucy

would hop onto after moving anti$-$clockwise

and skipping alternate cells.

Input

The first line of input consists of two integers$-$

matrix$\_$ row and matrix$\_$ col, representing the

number of rows $($N$)$ and the number of

columns $($M$)$ in the matrix, respectively.

The next M lines consist of N space$-$separated

integers representing the elements in each cell

of the matrix,

Output

Print an integer representing the last cell Lucy

would hop onto after following the given

instructions.

Example

Input.

$33$

$29337$

$15413$

$11014$

Output

$41$

Explanation:

Lucy starts with $29,$ skips $15,$ hops onto $1,$ skip

$10,$ hops onto $14,$ skips $3,$ hops onto $37,$ skips $8$

and finally hops onto $41$

So$,$ the output is $41$

Code in java

$"""$

matrix, represents the elements in each cell of the matrix of size N$*$M$.$

$"""$

def funcHopSkipJump$($matrix$)$:

# Write your code here

return

def main$()$:

# input for matrix

matrix $=[]$

matrix$\_$rows, matrix$\_$cols $=$ map$($int$,$ raw$\_$input$().$split$())$

for idx in range$($matrix$\_$rows$)$:

matrix.append$($list$($map$($int$,$ raw$\_$input$().$split$())))$

result $=$ funcHopSkipJump$($matrix$)$

print result,

if $\_\_$name$\_\_=="\_\_$main$\_\_"$:

main$()$