If $n=m.p^a$ where $p$ Is a prime and $p$ does not divide m

Question

Then ${n \choose p^a} \equiv m \pmod p$. I have read the original textbook proof but I still don't fully understand. Can somebody give me an explicit proof?