Minimize Digit Sum

Let $f(n, B)$ be the sum of digits of the integer $n$ when written in base $B$. More formally, if $n = \sum\limits_{i=0}^{\infty} a_i B^i$ where $a_i$ is an integer in the range $[0, B-1]$, then $f(n, B) = \sum\limits_{i=0}^{\infty} a_i$. Given $Q$ queries, each consisting of three integers $n, l$ and $r$. Find the value of $B$ corresponding to which $f(n, B)$ is minimum for all $l \leq B \leq r