9427: ABC211 —— C - chokudai
[Creator : ]
Description
You are given a string $S$.
How many ways are there to choose and underline eight of its characters so that those characters read `c`, `h`, `o`, `k`, `u`, `d`, `a`, `i` from left to right?
Since the count can be enormous, print it modulo $(10^9 + 7)$.
How many ways are there to choose and underline eight of its characters so that those characters read `c`, `h`, `o`, `k`, `u`, `d`, `a`, `i` from left to right?
Since the count can be enormous, print it modulo $(10^9 + 7)$.
Input
Input is given from Standard Input in the following format:
```
$S$
```
```
$S$
```
Output
Print the number of ways modulo $(10^9 + 7)$.
Constraints
- $8 \leq |S| \leq 10^5$
- $S$ consists of lowercase English letters.
- $S$ consists of lowercase English letters.
Sample 1 Input
chchokudai
Sample 1 Output
3
We have three valid ways:
chchokudai
chchokudai
chchokudai
while the following is invalid:
chchokudai
Sample 2 Input
atcoderrr
Sample 2 Output
0
Sample 3 Input
chokudaichokudaichokudai
Sample 3 Output
45