C. The Fair Nut and String（思维）

C. The Fair Nut and String

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 p1,p2,…,pk

, such that:

1. For each i

(1≤i≤k), spi=

• 'a'.
• For each i
• (1≤i<k), there is such j that pi<j<pi+1 and sj=
  1. 'b'.

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

  This number should be calculated modulo 109+7

  .

  Input

  The first line contains the string s

  (1≤|s|≤105

  ) consisting of lowercase Latin letters.

  Output

  In a single line print the answer to the problem — the number of such sequences p1,p2,…