$\mathbf{13 \text{ and } 15.}$
Consider the worst scenario: all processes require one more instance of the resource. So, $P1$ would have got $2, P2 - 3$ and $P3 - 5$. Now, if one more resource is available at least one of the processes could be finished and all resources allotted to it will be free which will lead to other processes also getting freed. So, $2 + 3 + 5 = 10$ would be the maximum value of $m$ so that a deadlock can occur.