The bear has a string *s* = *s*<sub class="lower-index">1</sub>*s*<sub class="lower-index">2</sub>... *s*<sub class="lower-index">|*s*|</sub> (record |*s*| is the string's length), consisting of lowercase English letters. The bear wants to count the number of such pairs of indices *i*, *j* (1 ≤ *i* ≤ *j* ≤ |*s*|), that string *x*(*i*, *j*) = *s*<sub class="lower-index">*i*</sub>*s*<sub class="lower-index">*i* + 1</sub>... *s*<sub class="lower-index">*j*</sub> contains at least one string "bear" as a substring.

String *x*(*i*, *j*) contains string "bear", if there is such index *k* (*i* ≤ *k* ≤ *j* - 3), that *s*<sub class="lower-index">*k*</sub> = *b*, *s*<sub class="lower-index">*k* + 1</sub> = *e*, *s*<sub class="lower-index">*k* + 2</sub> = *a*, *s*<sub class="lower-index">*k* + 3</sub> = *r*.

Help the bear cope with the given problem.
The first line contains a non-empty string *s* (1 ≤ |*s*| ≤ 5000). It is guaranteed that the string only consists of lowercase English letters.
t = int(input())
while t>0:
    s = input()
    n = len(s)
    no = []
    for i in range(n-3):
        if s[i]=='b':
            if s[i+1]=="e":
                if s[i+2]=="a":
                    if s[i+3]=="r":
                        no.append([i,i+3])
    #print(no)
    count = 0
    for key in range(len(no)):
        count = count+(no[key][0]+1)+(no[key][0]+1)*(n-no[key][1]-1)
        if key>0:
            j=key
            while j>0:
                #print("j",j)
                if no[key][0]>=no[key-1][1]:
                    i = no[key][1]
                    #print("i",i)
                    #print("n",n)
                    while i<n:
                        count-=1
                        i+=1
                j-=1
        #print("c",count)
    print(count)
    t-=1
    


        
    


    
    

            
    
    