What I have tried so far:
Combinatorial Proof: suppose there are $n$ people. first, we need to select a group of $r$ people. therefore, the number of ways to select $r$ people from $n$ people is $\binom {n}{r}$. Then, the number of ways to choose $k$ people from $r$ people is $\binom {r}{k}$. Therefore, the total number of ways to choose $k$ from $r$ from $n$ is $\binom {n}{r}\binom {r}{k}$.
RHS: To find the number of ways of choosing $k$ from $r$ from $n$, I can also pick $k$ people from $n$ people first, which the number of ways is $\binom {n}{k}$. But these $k$ people must be from a group of $r$ people. we need to consider the number of ways to choose the $r-k$ excluding $k$ from the rest of $n-k$, which the number of ways is $\binom {n-k}{r-k}$. therefore, the total number of ways to pick $k$ from $r$ from $n$ is $\binom {n}{k} \binom {n-k}{r-k}$.
Therefore, $\binom {n}{r}\binom {r}{k} = \binom {n}{k} \binom {n-k}{r-k}$
I'm not sure if I'm right. Can anyone correct me or improve my answer?