The bear has a string s = s1s2... s|s| (where |s| is the length of the string), which consists of lowercase English letters. The bear wants to determine the number of pairs of indices i, j (where 1 ≤ i ≤ j ≤ |s|) such that the substring x(i, j) = s_is_i+1... s_j contains at least one occurrence of the string "bear" as a substring. A substring x(i, j) contains the string "bear" if there exists an index k (where i ≤ k ≤ j - 3) such that s_k = b, s_k+1 = e, s_k+2 = a, and s_k+3 + 3 = r. Assist the bear in solving this problem.