Given a n * m matrix of 0s and 1s. For each square,find the sum of Manhattan distances from that square to the kth nearest 1s.

(Distance to closest 1 + distance to second closest 1 + ...)

n, m <= 2000

k <= n * m

There are at least k ones in the matrix. Thanks!