Use the inclusion-exclusion principle to give a combinatorial proof for the following claim $$\sum_{k=0}^{n} (-1)^k{n \choose k}{n -m\choose k-m} = 0, 1\leq m < n$$.
Will this first choose k elements out of n total elements then choose k elements out of n elements that do not contain m?