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

n, m, k = map(int, input().split())

min_balls = max(n, m)
if k < min_balls:
    print(-1)  # 对角线都铺不满，直接-1
else:
    # 初始化全0矩阵
    grid = [[0] * m for _ in range(n)]
    remaining = k
    i, j = 0, 0
    while i < n and j < m and remaining > 0:  #把对角线放满，保证行列都有
        grid[i][j] = 1
        remaining -= 1
        i += 1
        j += 1
    # 如果行多了，剩下的行补在第0列
    while i < n and remaining > 0:
        grid[i][0] = 1
        remaining -= 1
        i += 1
    # 如果列多了，剩下的列补在第0行
    while j < m and remaining > 0:
        grid[0][j] = 1
        remaining -= 1
        j += 1
    # 3. 把剩下的球全部塞到(0,0)
    grid[0][0] += remaining

    for row in grid:
        print(" ".join(map(str, row)))