Does there exist a totally explicit version of the Burgess theorem? Precisely, let $m$ be a positive integer, and let $\chi$ be a primitive character mod $m$. A special case (sufficient for my purposes) of the Burgess theorem asserts that
$\left| \sum_{a\le n\le a+x}\chi(n) \right|\ll_\varepsilon x^{1/2}m^{3/16+\varepsilon}$
I wonder if this was ever made totally explicit. In the case $m=p$ prime Iwaniec and Kowalski prove in their book the inequality with right-hand side $cx^{1/2}p^{3/16}(\log p)^{1/2}$ and claim (without going into details) that $c=30$ is nice.
I need, however, the case of composite modulus as well. Was anything like this ever done?