Identity \begin{equation} \sum_{k=0}^n\binom nk^2 \binom k{n-m}=\binom nm \binom{n+m}m \tag{1} \end{equation} was used in an answer here. As shown in that answer, (1) easily reduces to \begin{align} \sum_{k=0}^n\binom nk \binom m{n-k}=\binom{n+m}n, \tag{2} \end{align} which latter admits an obvious bijective proof.
Question: Is there a bijective proof of the original identity (1), without the reduction to (2)?
A possibly relevant reference is to automated search for bijective proofs.