h2. Date de intrare

Fişierul de intrare $words.in$ ...

The input file $words.in$ contains the word $W$, a string consisting of lowercase English letters.

h2. Date de ieşire

În fişierul de ieşire $words.out$ ...

The output file $words.out$ will contain the zero-based index in the dictionary modulo $10^9 + 7$.

h2. Restricţii

* $... ≤ ... ≤ ...$

* $1 ≤ |W| ≤ 10^5$
* For tests worth $20$ points, $1 ≤ |W| ≤ 3$.
* For tests worth $20$ more points, $W$ has only 'a' in it.
* For tests worth $40$ more points, $1 ≤ |W| ≤ 10^3$.

h2. Exemplu
table(example). |_. words.in |_. words.out |

| This is some
  text written on
  multiple lines.
| This is another
  text written on
  multiple lines.

| abba
| 18980

|

h3. Explicaţie
 
...

table(example). |_. words.in |_. words.out |
| verylongstring
| 315607945
|

== include(page="template/taskfooter" task_id="words") ==