Linear Programming

Corner points of the feasible region determined by the system of linear constraints are \((0,3),(1,1)\) and \((3,0)\). Let \(z=p x=q y\), where, \(p, q>0\). Condition on \(p\) and \(q\), so that the minimum of \(z\) occurs at \((3,0)\) and \((1,1)\) is