Bipartite Graphs and Matchings · Challenge problem

$X=\{p,q,r,s\}$ and $Y=\{1,2,3\}$ are joined by every edge of the complete bipartite graph $K_{4,3}$, and two extra edges $pq$ and $rs$ are added inside $X$. How many triangles does the resulting graph contain?