Bipartite Graphs and Matchings · Medium problem

A reviewer $1$ is assigned to any of five papers $a,b,c,d,e$; two other reviewers $2$ and $3$ are each assigned only to paper $a$. What is the minimum number of reviewers-or-papers needed to "touch" every (reviewer, paper) assignment listed here?