Sum of Missing Characters

Time limit1sMemory limit128 MB

Summary

For each string, sum the ASCII values of uppercase letters that never appear in it.

Level: Easy1 of 10
Topics: String, Hash map, Implementation
Solved: No attempts yet

Problem

Given a string S consisting only of uppercase English letters, compute the sum of the ASCII values of the uppercase letters that do not appear in S.

For example, if S is ABCDEFGHIJKLMNOPQRSTUVW, the letters that do not appear are X, Y, and Z. Their ASCII values are 88, 89, and 90, so the required sum is 267.

The ASCII values of the uppercase letters are as follows.

Letter	A	B	C	D	E	F	G	H	I	J	K	L	M	N	O	P	Q	R	S	T	U	V	W	X	Y	Z
ASCII	65	66	67	68	69	70	71	72	73	74	75	76	77	78	79	80	81	82	83	84	85	86	87	88	89	90

Input

The input consists of T test data sets. The first line contains an integer T, the number of test data sets. Each test data set consists of one line containing a string S. S contains only uppercase English letters and has length at most 1000.

Output

For each test data set, print on its own line the sum of the ASCII values of the uppercase letters that do not appear in S.

Examples1

Example 1
Input
```
2
ABCDEFGHIJKLMNOPQRSTUVW
A
```
Expected output
```
267
1950
```