Quicksum

In this problem you implement a checksum algorithm called Quicksum.

A Quicksum packet consists only of uppercase letters and spaces, and both the first and last characters are always uppercase letters. Spaces may appear between letters and may occur several times in a row.

The Quicksum is the sum, taken over every character, of (position) × (value). Positions are counted from the front of the packet starting at $1$. A space has value $0$, and a letter has the value $A = 1$, $B = 2$, $\dots$, $Z = 26$.

For example, the Quicksums of ACM and MID CENTRAL are computed as follows.

ACM: $1 \times 1 + 2 \times 3 + 3 \times 13 = 46$

MID CENTRAL: $1 \times 13 + 2 \times 9 + 3 \times 4 + 4 \times 0 + 5 \times 3 + 6 \times 5 + 7 \times 14 + 8 \times 20 + 9 \times 18 + 10 \times 1 + 11 \times 12 = 650$

Input continues until a line containing only #. Each packet is given on its own line and consists only of uppercase letters and spaces. A packet never starts or ends with a space. Each packet has length between $1$ and $255$ characters. The line containing only # marks the end of input and is not processed.

For each packet, print its Quicksum on its own line.