I am having troubles with this problem, I tried using a proof similar to that of Wilson's theorem but I can't get it to work! Any help would be greatly appreciated.

Show that if p is prime and $\displaystyle 2 \leq k < p$ then $\displaystyle (p-k)!(k-1)! \equiv (-1)^k \pmod{p}$