금지어 목록의 어떤 단어도 부분 문자열로 포함하지 않는 길이 L의 문자열 개수를 998244353으로 나눈 나머지로 구합니다.
You are given a list of words consisting of lowercase English letters. Calculate the number of words of length LLL that do not contain any of the words from the list as a substring.
Since the answer may be too big, print it modulo 998,244,353998\\,244\\,353998,244,353.
The first line contains two integers bbb and LLL (1≤b≤1001 \le b \le 1001≤b≤100; 1≤L≤109+71 \le L \le 10^9+71≤L≤109+7) --- the number of words in the list and word length you are interested in.
Each of the following bbb lines contains a non-empty word consisting of lowercase English letters. The words are distinct. The total length of the words is not greater than 100100100.
Print the number of words of length LLL that do not contain any word from the list as a substring, modulo 998,244,353998\\,244\\,353998,244,353.