The initial tableau of a linear programming problem is given. Use the simplex method to solve the problem.

$\left[\begin{array}{ccccccc}{x}_1& x_2& x_3& s_1& s_2& z& ?\\ 1& 6& 3& 1& 0& 0& 17\\ 4& 3& 5& 0& 1& 0& 40\\ -3& -2& -1& 0& 0& 1& 0\end{array}\right]$

The maximum is $,$ when $x_1=,x_2=,x_3=,s_1=,$ and $s_2=$

$($Type integers or simplified fractions.$)$