{"problem":{"name":"chokudai","description":{"content":"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 t","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc211_c"},"statements":[{"statement_type":"Markdown","content":"You are given a string $S$.  \nHow 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?  \nSince the count can be enormous, print it modulo $(10^9 + 7)$.\n\n## Constraints\n\n*   $8 \\leq |S| \\leq 10^5$\n*   $S$ consists of lowercase English letters.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc211_c","tags":[],"sample_group":[["chchokudai","3\n\nWe have three valid ways:\nchchokudai  \nchchokudai  \nchchokudai\nwhile the following is invalid:\nchchokudai"],["atcoderrr","0\n\nThe answer may be $0$."],["chokudaichokudaichokudai","45"]],"created_at":"2026-03-03 11:01:14"}}