KöMaL 2018 B4921

Let $n$ and $k$ denote positive integers. Prove that given $n+k$ integers it is always possible to select at least $(k+1)$ numbers out of them such that their sum is divisible by $n$.