Linear Programming

The corner points of the feasible region determined by the system of linear constraints are $(0,3),(1,1)$ and $(3,0)$, If objective function is $Z=p x+q y, p, q>0$ then the condition on $p$ and $q$ so that the minimum of $Z$ occurs at $(3,0)$ and $(1,1)$ is