We give a conversion from non-classical polynomials to $\mathit{MidBit}^+$ circuits and vice-versa. This conversion, along with previously known results, shows that torus polynomials, non-classical polynomials and $\mathit{MidBit}^+$ circuits can all be converted to each other. Therefore lower bounds against any of these models lead to lower bounds against all three of them. Each of these three models capture the power of $\mathit{ACC}$ circuits, which are circuits composed of $\mathit{AND}$, $\mathit{OR}$, $\mathit{MOD}_m$ gates for some constant natural number m. Hence lower bounds against any of these models lead to comparable lower bounds against ACC.