Bipartite Graphs and Matchings · Easy problem

Three students need rooms: $p$ can only use room $1$, $q$ can only use room $1$ as well, and $r$ can use room $1$, $2$, or $3$. What is the maximum number of students who can be simultaneously assigned to distinct rooms?