MathNet 2010 — Part 04 Question 34

Let $p$ be a positive integer, $p \gt 1$. Find the number of $m \times n$ matrices with entries in the set $\{1,2,3,..., p\}$ and such that the sum of elements on each row and each column is not divisible by $p$.