CF1926C.Vlad and a Sum of Sum of Digits

Please note that the time limit for this problem is only 0.5 seconds per test.

Vladislav wrote the integers from $1$ to $n$, inclusive, on the board. Then he replaced each integer with the sum of its digits.

What is the sum of the numbers on the board now?

For example, if $n=12$ then initially the numbers on the board are: $$1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12.$$ Then after the replacement, the numbers become: $$1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3.$$ The sum of these numbers is $1+2+3+4+5+6+7+8+9+1+2+3=51$. Thus, for $n=12$ the answer is $51$.

请注意，本题的时间限制仅为每个测试点 0.5 秒。

弗拉迪斯拉夫在黑板上写下了从 $1$ 到 $n$（含）的所有整数。然后他将每个整数替换为其各位数字之和。

此时黑板上所有数字的总和是多少？

例如，若 $n=12$，则黑板上初始的数字为：

$$1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12.$$

替换后，这些数字变为：

$$1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3.$$

这些数字的总和为 $1+2+3+4+5+6+7+8+9+1+2+3=51$。因此，当 $n=12$ 时，答案为 $51$。

The first line contains an integer $t$ ($1 \leq t \leq 10^4$) — the number of test cases.

The only line of each test case contains a single integer $n$ ($1 \leq n \leq 2 \cdot 10^5$) — the largest number Vladislav writes.

第一行包含一个整数 $t$（$1 \leq t \leq 10^4$）—— 测试用例的数量。

每个测试用例仅有一行，包含一个整数 $n$（$1 \leq n \leq 2 \cdot 10^5$）—— 弗拉迪斯拉夫所写的最大数字。

For each test case, output a single integer — the sum of the numbers at the end of the process.

对于每个测试用例，输出一个整数——即该过程结束时所有数字的总和。