ISL 1970 Problem 57

Let the numbers $1, 2, \ldots , n^2$ be written in the cells of an $n \times n$ square board so that the entries in each column are arranged increasingly. What are the smallest and greatest possible sums of the numbers in the $k^{th}$ row? ( $k$ a positive integer, $1 \leq k \leq n$ .)