<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.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
static const int __ = [](){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    return 0;
}();

constexpr pair<int, int> dirs[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

int init = [] {
    ofstream out("user.out");
    cout.rdbuf(out.rdbuf());
    for (string m_str, n_str, str; getline(cin, m_str) && getline(cin, n_str) && getline(cin, str);) {
        const int m = stoi(m_str);
        const int n = stoi(n_str);
        vector<vector<int>> v(m, vector<int>(n, -1));
        istringstream ss(str); ss.ignore();
        ostringstream os;
        int up = 0, down = m - 1, left = -1, right = n - 1;
        while (ss.peek() != char_traits<char>::eof()) {
            for (int num, col = ++left; col <= right && ss >> num; ++col, ss.ignore()) {
                v[up][col] = num;
            }

            for (int num, row = ++up; row <= down && ss >> num; ++row, ss.ignore()) {
                v[row][right] = num;
            }

            for (int num, col = --right; col >= left && ss >> num; --col, ss.ignore()) {
                v[down][col] = num;
            }

            for (int num, row = --down; row >= up && ss >> num; --row, ss.ignore()) {
                v[row][left] = num;
            }
        }
        os << '[';
        for (int i = 0; i < m; ++i) {
            os << '[';
            for (int j = 0; j < n; ++j) {
                os << v[i][j];
                if (j != n - 1) os << ',';
            }
            os << ']';
            if (i != m - 1) os << ',';
        }
        os << "]\n";
        cout << os.str();
    }
    exit(0);
    return 0;
}();

class Solution {
public:
    vector<vector<int>> spiralMatrix(int m, int n, ListNode* head) {
        return {};
    }
};
50800