2D max pooling that also returns where each maximum came from

Implement 2D max pooling over a grid of integers: a k by k window moves across the grid with a given stride, and each window outputs its maximum. Follow-up: for every output cell, also return the coordinates in the input of the maximum, and say how you break ties.