How to use the Pumping Lemma to prove that a restricted subset of 0*1*2*3*, where there are as many 3's as 0's and 1's, is not a CFL?
Use $|uyv|\le p$ to avoid the cases you mention, e.g., that $u,v$ pump both the $1$'s and the $3$'s. You can choose $p,q$ in $w$ such a way that this way of pumping is not possible. There is no problem in choosing $p=q$!