A circular disk is divided by $2n$ equally spaced radii ($n > 0$) and one secant line. What is the maximum number of non-overlapping areas into which the disk can be divided? The original answer is in the form $kn + m$. Please find the value of $k + m$.

Let's think step by step and output the final answer within \boxed{}.
user