Base Palindrome

You like palindrome number very much So you decided to solve one problem. You are given three numbers $N$ ,$M$ and $B$ ($N,M$ in base $10$). You want to count sum of digit of all palindrome numbers between $N$ and $M$ (inclusive) In base $B$. ###Input: - First line of input is number of testcases $T$ $(1 \le T \le 10^5)$. - Each testcase contain three number $N,M,B$ $(1\le N \le M \le