\begin{proof} For a configuration, $Z$ and $y$ are given by the formulas of Lemma~\ref{lem:gadget}(b): $Z=\frac12G$, where $G_{ij}$ is the number of letters that map $x_i$ to $x_j$, and $y=\frac12(\nu_1,\nu_2)$. Let $\Delta=\det(2I-G)=4\det(I-Z)$. When $\Delta\neq0$, the vector $t=y(I-Z)^{-1}=(\nu_1,\nu_2)(2I-G)^{-1}$ is \[t_1=\frac{(2-G_{22})\nu_1+G_{21}\nu_2}{\Delta},\qquad t_2=\frac{G_{12}\nu_1+(2-G_{11})\nu_2}{\Delta}.\] Evaluating $\Delta$, $t_1$ and $t_2$ for the $3^4$ choices of the four targets and the five pairs $(\nu_1,\nu_2)$ leaves exactly $179$ configurations with $\Delta\neq0$ and $t_1,t_2>0$. Each row of $G$ sums to at most $2$; so $\Delta=(2-G_{11})(2-G_{22})-G_{12}G_{21}\geq0$, with equality if and only if $\{x_1\}$, $\{x_2\}$ or $X$ is closed ($G_{11}=2$, or $G_{22}=2$, or both rows sum to $2$), which excludes $26$ of the $81$ choices of the four targets. For the other $55$, $G_{11}<2$ and $G_{22}<2$; so by the formula $t_1>0$ if and only if $\nu_1>0$, or $\nu_2>0$ and $G_{21}>0$, and likewise for $t_2$, with $G_{12}$. As $31$ of the $55$ have $G_{12}>0$ and $31$ have $G_{21}>0$, the pair $(1,1)$ gives $55$ configurations and each of the other four pairs gives $31$: $55+4\cdot31=179$. The two renamings generate a group of order four, which permutes these $179$ configurations and preserves the class. It has one orbit of size one, seven orbits of size two and $41$ orbits of size four, and $1+7\cdot2+41\cdot4=179$; so there are $1+7+41=49$ configurations up to renaming. Table~\ref{tab:configs} lists one configuration of each orbit, with its class; the classes that occur are the $14$ of Table~\ref{tab:classes}. \end{proof}