Prove : n * log(n) + m * log(m) < n * m

Question

How do I prove complexity n * log(n) + m * log(m) is faster than n * m

In other words, how do I prove?

$N \cdot \log_2(N) + M \cdot \log_2(M) < NM$