Alice got a message M. It is in an alien language. A string in an alien language is said to be valid if it contains the letter a or z.  Alice decided to count the number of valid substrings  of the message M. Help him to do this. Two substrings are different if it occurs at different positions in the message.  

Input
First line of the input contains the number of test cases T. It is followed by T lines. Each line has a single string M.  

Output
For each test case, output a single number, the number of valid substrings.   

Constraints
|M| ≤ 10^6 
M contains only lower case latin latters, that is characters a to z.

Read the editorial here.

SAMPLE INPUT
4
abcd
azazaz
abbzbba
flkjdh

SAMPLE OUTPUT
4
21
22
0
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
t = int(raw_input())

while t:
	t-=1
	s = raw_input().strip()
	
	count = 0
	prev = 0
	curr = 0
	l = len(s)
	s = s.replace("a", "z")
	n_s = 0
	
	# Logic for counting sub-strings not containing z
	n_s = sum([(len(i)*(len(i)+1))>>1 for i in s.split("z")])
		
	
	print ((l*(l+1))>>1) - n_s


# Logic for counting sub-strings contaning z
"""
		for i, v in enumerate(s):
			if v == "z":
				count += l - i
				prev += curr
				count += prev
				
				curr = 0
			else:
				count += prev
				curr += 1
"""