An urn contains $\displaystyle n$ balls numbered $\displaystyle 1$ through $\displaystyle n$. If you withdraw $\displaystyle m$ balls randomly in sequence, each time replacing the ball selected previously, find $\displaystyle P[X=k], k=1,2,...,m$, where $\displaystyle X$ is the maximum of the $\displaystyle m$ chosen numbers

I'm not even sure what this question is asking me to find. Can someone help me clarify the question please?