题解 | 球格模型（简单版）

C++得了MVP，Python是躺赢狗

while True:
    try:
        n, m, k = map(int, input().split())
        if k < max(n, m):
            print(-1)
        else:
            lst = [['0'] * m for _ in range(n)]
            i = j = 0
            while i <= n-1 and j <= m-1:
                lst[i][j] = '1'
                i += 1
                j += 1
            if i < n -1:
                while i < n -1:
                    lst[i][m-1] = '1'
                    i += 1
            elif j < m -1:
                while j < m - 1:
                    lst[n-1][j] = '1'
                    j += 1
            else:
                lst[n-1][m-1] = str(k - max(n, m) + 1)
            for each in lst:
                print(' '.join(each))

    except:
        break