영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
You are given a string of length n and a dictionary containing k words. In how many ways can you create the string using the words?
Input
The first input line has a string containing n characters between a–z.
The second line has an integer k: the number of words in the dictionary.
Finally there are k lines describing the words. Each word is unique and consists of characters a–z.
Output
Print the number of ways modulo 10^9+7.
Constraints
- 1 ≤ n ≤ 5000
- 1 ≤ k ≤ 10^5
- the total length of the words is at most 10^6
Example
Explanation: The possible ways are ab+ab+c and abab+c.
예제
예제 1
ababc 4 ab abab c cb
2