Question 140
Let $n_1, n_2, \dots, n_{26}$ be pairwise distinct positive integers, satisfying:
(1) In the decimal representation of each $n_i$, each digit belongs to the set $\{1, 2\}$;
(2) For any $i, j$, $n_j$ cannot be obtained from $n_i$ by adding some digits on the right.
Find the least possible value of $\sum_{i=1}^{26} S(n_i)$, where $S(m)$ denotes the sum of all digits of $m$ in decimal representation.
(1) In the decimal representation of each $n_i$, each digit belongs to the set $\{1, 2\}$;
(2) For any $i, j$, $n_j$ cannot be obtained from $n_i$ by adding some digits on the right.
Find the least possible value of $\sum_{i=1}^{26} S(n_i)$, where $S(m)$ denotes the sum of all digits of $m$ in decimal representation.