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

n, m, k = map(int,input().split())
def func(n, m, k):
    l = [[0 for j in range(m)] for i in range(n)]
    if n > m:
        for i in range(n):
            if i <= m - 1:
                l[i][i] = 1
            elif i > m - 1 and i < n - 1:
                l[i][0] = 1
            else:
                l[i][0] = k - (n - 1)
    elif n < m:
        for i in range(m):
            if i <= n - 1:
                l[i][i] = 1
            elif i > n - 1 and i < m - 1:
                l[0][i] = 1
            else:
                l[0][i] = k - (m - 1)
    else:
        for i in range(n):
            if i < n - 1:
                l[i][i] = 1
            else:
                l[i][i] = k - (n - 1)
    return l
if k < max(n,m):
    print(-1)
else:
    results = func(n, m, k)
    for result in results:
        result = [str(i) for i in result]
        print(" ".join(result))