You are given two integers m and n, which represent the dimensions of an $m \times n$ matrix. You are also given the head of a linked list of integers.

Generate an $m \times n$ matrix filled with the elements of the linked list in clockwise spiral order, beginning at the top left cell at position $(0, 0)$ and proceeding from left to right, then downwards, and so forth.

If there are empty cells remaining in the matrix after exhausting all elements of the linked list, fill these remaining cells with $-1$.

Return the generated matrix.

Constraints:

• $1 \leq$ m, n $\leq 10^5$

• $1 \leq$ m $\times$ n $\leq 10^5$

• The number of nodes in the list is in the range $[1,$ m $\times$ n$]$.

• $0 \leq$ Node.val $\leq 1000$

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.