You are given an $m \times n$ integer matrix mat and an integer k.

In one cyclic shift:

• Rows at even indices are cyclically shifted to the left by $1$ position.

• Rows at odd indices are cyclically shifted to the right by $1$ position.

After repeating this process k times on mat, return true if the final matrix is identical to the original matrix mat, and false otherwise.

Constraints:

• $1 \leq$ mat.length $\leq 25$

• $1 \leq$ mat[i].length $\leq 25$

• $1 \leq$ mat[i][j] $\leq 25$

• $1 \leq$ k $\leq 50$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.