Boring Apartments

我们把仅由一个或多个相同的数位组成的数字叫作“无聊的数字”。我们把 $\leqslant 10000$ 的这种数字按照以下规则排列： - 首先，将仅由 $1$ 组成的 $\leqslant 10000$ 的“无聊的数字”按照升序排列：$1,11,111,1111,...$。 - 再将仅由 $2$ 组成的 $\leqslant 10000$ 的“无聊的数字”按照升序排列：$2,22,222,2222,...$。 - 以此类推。 给出 $t$ 次询问，每次询问给定一个无聊的数字 $x$，请求出当数列排到 $x$ 时，$x$ 以及前面所有的“无聊的数字”的位数之和。 **数据范围：$1\leqslant t\leqslant 36,1\leqslant x\leqslant 9999$。**

There is a building consisting of $ 10~000 $ apartments numbered from $ 1 $ to $ 10~000 $ , inclusive. Call an apartment boring, if its number consists of the same digit. Examples of boring apartments are $ 11, 2, 777, 9999 $ and so on. Our character is a troublemaker, and he calls the intercoms of all boring apartments, till someone answers the call, in the following order: - First he calls all apartments consisting of digit $ 1 $ , in increasing order ( $ 1, 11, 111, 1111 $ ). - Next he calls all apartments consisting of digit $ 2 $ , in increasing order ( $ 2, 22, 222, 2222 $ ) - And so on. The resident of the boring apartment $ x $ answers the call, and our character stops calling anyone further. Our character wants to know how many digits he pressed in total and your task is to help him to count the total number of keypresses. For example, if the resident of boring apartment $ 22 $ answered, then our character called apartments with numbers $ 1, 11, 111, 1111, 2, 22 $ and the total number of digits he pressed is $ 1 + 2 + 3 + 4 + 1 + 2 = 13 $ . You have to answer $ t $ independent test cases.

The first line of the input contains one integer $ t $ ( $ 1 \le t \le 36 $ ) — the number of test cases. The only line of the test case contains one integer $ x $ ( $ 1 \le x \le 9999 $ ) — the apartment number of the resident who answered the call. It is guaranteed that $ x $ consists of the same digit.

For each test case, print the answer: how many digits our character pressed in total.

4
22
9999
1
777

13
90
1
66