<p>You are given two integers <code>m</code> and <code>n</code>, which represent the dimensions of a matrix.</p>

<p>You are also given the <code>head</code> of a linked list of integers.</p>

<p>Generate an <code>m x n</code> matrix that contains the integers in the linked list presented in <strong>spiral</strong> order <strong>(clockwise)</strong>, starting from the <strong>top-left</strong> of the matrix. If there are remaining empty spaces, fill them with <code>-1</code>.</p>

<p>Return <em>the generated matrix</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2022/05/09/ex1new.jpg" style="width: 240px; height: 150px;" />
<pre>
<strong>Input:</strong> m = 3, n = 5, head = [3,0,2,6,8,1,7,9,4,2,5,5,0]
<strong>Output:</strong> [[3,0,2,6,8],[5,0,-1,-1,1],[5,2,4,9,7]]
<strong>Explanation:</strong> The diagram above shows how the values are printed in the matrix.
Note that the remaining spaces in the matrix are filled with -1.
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2022/05/11/ex2.jpg" style="width: 221px; height: 60px;" />
<pre>
<strong>Input:</strong> m = 1, n = 4, head = [0,1,2]
<strong>Output:</strong> [[0,1,2,-1]]
<strong>Explanation:</strong> The diagram above shows how the values are printed from left to right in the matrix.
The last space in the matrix is set to -1.</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= m, n &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= m * n &lt;= 10<sup>5</sup></code></li>
	<li>The number of nodes in the list is in the range <code>[1, m * n]</code>.</li>
	<li><code>0 &lt;= Node.val &lt;= 1000</code></li>
</ul>

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def spiralMatrix(self, m: int, n: int, head: Optional[ListNode]) -> List[List[int]]:
        matrix = [[-1 for i in range(n)] for j in range(m)]
        dir = 1
        x, y = 0, 0
        xmin, xmax, ymin, ymax = 0, n, 0, m


        curr = head
        while True:
            # Up
            if dir == 0:
                if y == ymin:
                    if curr:
                        matrix[y][x] = curr.val
                    return matrix
                for i in range(y - ymin):
                    if curr:
                        matrix[y][x] = curr.val
                        curr = curr.next
                    y -= 1
                xmin += 1
            
            # Right
            elif dir == 1:
                if x == xmax:
                    if curr:
                        matrix[y][x] = curr.val
                    return matrix
                for i in range(xmax - x - 1):
                    if curr:
                        matrix[y][x] = curr.val
                        curr = curr.next
                    x += 1
                ymin += 1

            # Down
            elif dir == 2:
                if y == ymax:
                    if curr:
                        matrix[y][x] = curr.val
                    return matrix
                for i in range(ymax - y - 1):
                    if curr:
                        matrix[y][x] = curr.val
                        curr = curr.next
                    y += 1
                xmax -= 1

            # Left
            elif dir == 3:
                if x == xmin:
                    if curr:
                        matrix[y][x] = curr.val
                    return matrix
                for i in range(x - xmin):
                    if curr:
                        matrix[y][x] = curr.val
                        curr = curr.next
                    x -= 1
                ymax -= 1

            # After reaching end, update dir
            dir = (dir + 1) % 4  
55900