Time Limit: 4000/2000 MS (Java/Others)

Memory Limit: 131072/131072 K (Java/Others)

Talented

The summation may be quite large, so you should output it in modulo $10^9 + 7$.

The input contains multiple test cases.

For each test case, the first line contains one positive integers $n$, the number of strings. $(1 \leq n \leq 100000)$

Each of the next $n$ lines contains a string $s_i$ consisting of only lower case letters. $(1 \leq |s_i| \leq 100000, \sum{|s_i|} \leq 10^6)$

For each test case, the first line contains one positive integers $n$, the number of strings. $(1 \leq n \leq 100000)$

Each of the next $n$ lines contains a string $s_i$ consisting of only lower case letters. $(1 \leq |s_i| \leq 100000, \sum{|s_i|} \leq 10^6)$

提交代码