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 main() {
  string s, g;
  cin >> g;
  long long n, i, j, k, sol;
  for (i = 0; i < g.length(); i++) {
    if (g[i] == 'a' || g[i] == 'b') s += g[i];
  }
  vector<long long> a;
  vector<long long> b;
  n = s.length();
  for (i = 0; i < n; i++) {
    if (s[i] == 'a') a.push_back(i);
    if (s[i] == 'b') b.push_back(i);
  }
  if (b.empty()) {
    cout << a.size() << endl;
    return 0;
  }
  long long count = 1, m;
  n = a.size();
  m = b.size();
  j = 0;
  bool bexist = true;
  long long t = 0;
  for (i = 0; i < n; i++) {
    j = i + 1;
    while (j < n && a[j] == a[j - 1] + 1) {
      j++;
    }
    t++;
    count = (count * (j - i + 1)) % 1000000007;
    i = j - 1;
  }
  cout << count - 1 << endl;
}
