acm1183题：像所有的女孩子一样，LT讨厌排列，他现在向你寻求一个排列问题的答案



给你一个数字N（1<=N<10000),并且N的各个位上没有0

他想知道将N的每个位置上的数字全部拿出来，重新排列得到的所有数字的和是多少

比如122的所有排列为：122+212+221=555Input 有多组输入数据，第一行为一个数字case，代表有多少组输入数据 (case<=20)

以下case行每行包含一个正整数N(1<=N<10000),N的意义如上所述Output 一共case行，每行一个整数对应N的所有排列得到的数字的和

Sample Input2

122

12Sample Output555

-Like all the other girls, LT hate arrangement, he is now looking for answers to your questions to give you an arranged a number N (1 < = N < 10000), and no individual bits of the N 0 to N, he wanted to know every digital position all out, rearrange and get all the numbers is the number 122, for example, all arranged as: 122+212+221 = 555Input multiple sets of input data, the first acts of a number of case, on behalf of many sets of input data (case < = 20) the following case lines contains a positive integer N (1 < = N < 10000), N total case meaning above Output lines, each corresponding to an integer number obtained all permutations of N and Sample Input2 122 12Sample Output555 33