• 好像没看见用python实现的，这里贴一个给有需要的朋友参考一下吧

n, m, k = map(int,input().split(" "))
list1 = []
for _ in range(0,n):
    list1.append(list(map(int, input().split(" "))))

answer = [set() for _ in range(k)]

for person in range(n):
    for index in range(m): 
        answer[list1[person][index] - 1].add(index)
# 借助集合特性，遍历每一个人：A第二天做第一套，则在第二天必会出第一套题，加入answer[2]的集合add.(1)

results = [len(answer[ind]) for ind in range(k)]
print(" ".join(map(str, results)))