Bipartite Graphs and Matchings · Challenge problem

$X=\{1,2,3\}$ and $Y=\{a,b,c,d\}$ are joined by every edge of the complete bipartite graph $K_{3,4}$. How many matchings of SIZE EXACTLY $3$ does this graph have?