The Fair Nut found a string s. The string consists of lowercase Latin letters. The Nut is a curious guy, so he wants to find the number of strictly increasing sequences p_1, p_2, …, p_k, such that: 

  1. For each i (1 ≤ i ≤ k), s_{p_i} = 'a'. 
  2. For each i (1 ≤ i < k), there is such j that p_i < j < p_{i + 1} and s_j = 'b'. 



The Nut is upset because he doesn't know how to find the number. Help him.

This number should be calculated modulo 10^9 + 7.

Input

The first line contains the string s (1 ≤ |s| ≤ 10^5) consisting of lowercase Latin letters.

Output

In a single line print the answer to the problem — the number of such sequences p_1, p_2, …, p_k modulo 10^9 + 7.

Examples

Input

abbaa


Output

5

Input

baaaa


Output

4

Input

agaa


Output

3

Note

In the first example, there are 5 possible sequences. [1], [4], [5], [1, 4], [1, 5].

In the second example, there are 4 possible sequences. [2], [3], [4], [5].

In the third example, there are 3 possible sequences. [1], [3], [4].
#include <bits/stdc++.h>
using namespace std;
int dp[100003], v[100003];
char s[100003];
int main() {
  char x;
  long long int nr = 0, i, sum = 0, lg;
  cin >> s;
  lg = strlen(s);
  for (i = 0; i < lg; i++) {
    x = s[i];
    if (x == 'a') v[++nr] = 1;
    if (x == 'b') v[++nr] = 0;
  }
  for (i = 1; i <= nr; i++)
    if (v[i] == 1) {
      if (v[i - 1] == 1)
        dp[i] = dp[i - 1];
      else
        dp[i] = sum + 1;
      sum += dp[i];
      sum %= 1000000007;
    }
  cout << sum;
  return 0;
}
