KURSCHAK 2009 Problem 1

Let $n,k$ be arbitrary positive integers. We fill the entries of an $n\times k$ array with integers such that all the $n$ rows contain the integers $1,2,\dots,k$ in some order. Add up the numbers in all $k$ columns - let $S$ be the largest of these sums. What is the minimal value of $S$ ?