The matrix $A=\begin{pmatrix}17&-30\\11&-17\end{pmatrix}$ defines your linear map $T$, but using the basis $B=[b_1,b_2]=[\binom{-1}{-2},\binom23]$ (rather than the canonical basis $E=[e_1,e_2]=\binom10,\binom01]$) at departure, while using the canonical basis $E$ at arrival: this means that $T(xb_1+yb_2)=A\cdot\binom xy$ (you can check that this is what is given, for $(x,y)=(1,0)$ and for $(x,y)=(0,1)$; the general case follows by linearity). I would personally write this (but the notation is not widely used) as $A={}_C\!\operatorname{Mat}_B(T)$; the idea of this notation is that the basis at departure is written at the right where the vector argument "enters", and the basis at arrival is written on the left where the result "leaves" the matrix multiplication. You want to know $M={}_C\!\operatorname{Mat}_C(T)$, the matrix when using the canonical bases all the time.
This means you want to take a vector $\binom xy$ expressed in $C$, first transform it into coordinates on $B$ (find $x',y'$ such that $\binom xy=x'b_1+y'b_2$) and then compute $A\cdot\binom{x'}{y'}$. The opposite coordinate transformation is easy: given $x',y'$ one has $\binom xy=x'b_1+y'b_2=\begin{pmatrix}-1&2\\-2&3\end{pmatrix}\cdot\binom{x'}{y'}$. But then we must have $\binom{x'}{y'}=\begin{pmatrix}-1&2\\-2&3\end{pmatrix}^{-1}\cdot\binom xy$, and one can compute $ \begin{pmatrix}-1&2\\-2&3\end{pmatrix}^{-1} = \begin{pmatrix}3&-2\\2&-1\end{pmatrix}. $ Now the compound operation of first doing the coordinate transform from $\binom xy$ to $\binom{x'}{y'}$ and then applying the linear map $T$ through its matrix $A$ has as matrix $M$ the matrix product $ M = A \cdot\begin{pmatrix}-1&2\\-2&3\end{pmatrix}^{-1} =\begin{pmatrix}17&-30\\11&-17\end{pmatrix}\cdot \begin{pmatrix}3&-2\\2&-1\end{pmatrix} =\begin{pmatrix}-9&-4\\-1&-5\end{pmatrix}. $