<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: ListNode) -> list[list[int]]:
        # Initialize the matrix with -1
        matrix = [[-1 for _ in range(n)] for _ in range(m)]
        
        # Define the boundaries
        top, bottom, left, right = 0, m - 1, 0, n - 1
        
        # Initialize current node to the head of the linked list
        curr = head
        
        # Fill the matrix in spiral order
        while curr and top <= bottom and left <= right:
            # Fill the top row (left to right)
            for col in range(left, right + 1):
                if curr:
                    matrix[top][col] = curr.val
                    curr = curr.next
            top += 1  # Move the top boundary down
            
            # Fill the right column (top to bottom)
            for row in range(top, bottom + 1):
                if curr:
                    matrix[row][right] = curr.val
                    curr = curr.next
            right -= 1  # Move the right boundary left
            
            # Fill the bottom row (right to left)
            if top <= bottom:
                for col in range(right, left - 1, -1):
                    if curr:
                        matrix[bottom][col] = curr.val
                        curr = curr.next
                bottom -= 1  # Move the bottom boundary up
            
            # Fill the left column (bottom to top)
            if left <= right:
                for row in range(bottom, top - 1, -1):
                    if curr:
                        matrix[row][left] = curr.val
                        curr = curr.next
                left += 1  # Move the left boundary right
        
        return matrix

        
55800