On Maillet determinant

For a positive integer m, let $\text{A = {1 ≤ a <}\text{m}\text{2}\text{| (a, m) = 1}}$ and let n = |A|. For an integer x, let R(x) be the least positive residue of x modulo m and if (x, m) = 1, let x′ be the inverse of x modulo m. If m is odd, then |R(ab′)|_a,b∈A = ?2^1?n(∏_χ(Σ_{a = 1}^{m ? 1}aχ(a))), where χ runs over all the odd Dirichlet characters modulo m.