C - chokudai AtCoder Beginner 211（字符串+动态规划DP）

题目描述：

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).

数据范围：

• 8≤|S|≤10^5

• S consists of lowercase English letters.

输入：

Input is given from Standard Input in the following format:

S

输出：

Print the number of ways modulo (10^9+7).

样例输入1：

chchokudai

样例输出1：

3

We have three valid ways:

chchokudai chchokudai chchokudai

while the following is invalid:

chchokudai<