Chefina  is  always interested to play with string. But due to exam pressure she has no time to solve a string problem. She wants your help. Can you help her to solve that problem?
You are given a string. You have to find out the $Wonder$ $Sum$ of the string. $Wonder$ $Sum$ of a string is defined as the sum of the value of each character of the string. 
The value of each character means:
- If the string is started with "a" , then the value of each character of the string is like "a"=100, "b"=101, "c"="102" ………"z"=125.
- If the string is started with "z" , then the value of each character of the string is like "a"=2600, "b"=2601, "c"="2602" ………"z"=2625.
Since even the $Wonder$ $Sum$ can be large, output $Wonder$ $Sum$ modulo  ($10^9 + 7$).

-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow. 
- Each testcase contains of a single line of input, a string $S$ with lower case alphabet 
only.

-----Output:-----
For each testcase, output in a single line integer i.e.  $Wonder$ $Sum$ modulo  ($10^9 + 7$).

-----Constraints-----
- $1 \leq T \leq 1000$
- $1 \leq |S| \leq 10^5$

-----Sample Input:-----
$2$$cab$
$sdef$

-----Sample Output:-----
$903$
$7630$

-----EXPLANATION:-----
i) For the first test case, since the string is started with "$c$", so output is ($302$+$300$+$301$)=$903$
ii)For the second test case, since the string is started with "$s$", so output is ($1918$+$1903$+$1904$+$1905$)=$7630$

Difficulty: UNKNOWN_DIFFICULTY

Solutions:
for _ in range(int(input())):
	string = input().rstrip()
	start = (ord(string[0]) - 96) * 100
	sum = 0
	for i in range(len(string)):
		sum += start + (ord(string[i]) - 97)
	print(sum % 1000000007)


for _ in range(int(input())):
	s = input()
	res = 0
	cnt = 0
	for c in s:
		if 96 < ord(c) < 123:
			cnt += 1
			res += ord(c)
	res -= 97 * cnt
	res += (ord(s[0]) - 96) * 100 * cnt
	print(res % 1000000007)


for i in range(int(input())):
	s = input()
	res = 0
	mu = (ord(s[0]) - 96) * 100
	for c in s:
		if 96 < ord(c) < 123:
			res += ord(c) - 97 + mu
			if res > 1000000007:
				res -= 1000000007
	print(res)


t = int(input())
for _ in range(t):
	s = list(''.join(input().split()))
	alph = ['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']
	n = int('{}00'.format(ord(s[0]) - 96))
	res = 0
	for i in s:
		res += n + ord(i) - 97
	print(res % 1000000007)


MOD = 10 ** 9 + 7
for _ in range(int(input())):
	s = input().strip().lower()
	while not s:
		s = input().strip().lower()
	st = (ord(s[0]) - ord('a') + 1) * 100
	d = 0
	for i in s:
		d += st + ord(i) - ord('a')
	print(d % MOD)


from collections import Counter
for testcase in range(int(input())):
	string = input()
	letter_count = Counter(string)
	letter_value = lambda x: ord(x) - 97
	base_value = (letter_value(string[0]) + 1) * 100
	net_sum = 0
	for letter in range(97, 97 + 26):
		net_sum += (base_value + letter_value(chr(letter))) * letter_count[chr(letter)] % int(1000000000.0 + 7)
	print(net_sum % int(1000000000.0 + 7))


from collections import defaultdict
d = defaultdict(int)
for i in range(97, 123):
	d[chr(i)] = 100 * (i - 96)
t = int(input())
for _ in range(t):
	s = input()
	val = defaultdict(int)
	ini = d[s[0].lower()]
	for i in range(97, 123):
		val[chr(i)] = ini + (i - 97)
	mod = 10 ** 9 + 7
	ans = 0
	for i in s:
		ans += val[i.lower()]
		ans = ans % mod
	print(ans)


from sys import stdin
MODULO = 1000000007
for testcase in range(int(stdin.readline().strip())):
	s = stdin.readline().strip()
	s0 = (ord(s[0]) - 96) * 100
	wsum = sum([ord(ch) - 97 for ch in s]) + s0 * len(s)
	print(wsum % MODULO)