Коробка конфет

import numpy as np
matrix = np.array(
         [[-2,  5,  3,  2],
          [ 9, -6,  5,  1],
          [ 3,  2,  7,  3],
          [-1,  8, -4,  8]])
 
diags = [matrix[::-1,:].diagonal(i) for i in range(-3,4)]
diags.extend(matrix.diagonal(i) for i in range(3,-4,-1))
print([n.tolist() for n in diags])

n = int(input())
m = int(input())
k = int(input())
matrix = list()
for _ in range(n):
    row = list()
    for _ in range(m):
        row.append(0)
    matrix.append(row)
for row in matrix:
    print(row)
a = n * m / 2
if a % 2 == 0:
    print(round(a))
else:
    print(round(a - 0.5))

n = int(input())
m = int(input())
k = int(input())
 
a = [[1 for _ in range(m)] for _ in range(n)]
 
d = [0] * k
for i in range(0, n):
    s = i % k
    for j in range(0, m):
        d[s] += 1
        s = (s + 1) % k
 
print(d)

from books import skillfullhands

from random import shuffle, randint
 
def shuffle_lst(lst):
    b = [*enumerate(lst)]
    for i in lst:
        if lst.count(i) > len(lst) // 2:
            return -1
    while set(b).intersection(set(enumerate(lst))):
        shuffle(lst)
 
    return lst
 
 
a = [randint(0, 100) for _ in range(30)]
print(a)
print(shuffle_lst(a))

n = int(input())
m = int(input())
k = int(input())
arr = 0
a = [[1 for _ in range(m)] for _ in range(n)]
f = 0
arr = [0] * k
for i in range(0, n):
    f = i % k
    for j in range(0, m):
        arr[f] += 1
        f = (f + 1) % k
print(*arr)