Row Reduction & Rank · Hard problem

A shipment of three package sizes uses counts $x,y,z$ satisfying $x+2y+3z=20$ and $2x-y+z=5$ — two independent constraints leaving one free integer parameter. All three counts must be positive integers. Among all choices keeping every count a positive integer, find $y$ at the LARGEST possible value of $z$.