CF452E Three strings

You are given three strings $ (s_{1},s_{2},s_{3}) $ . For each integer $ l $ $ (1

First three lines contain three non-empty input strings. The sum of lengths of all strings is no more than $ 3·10^{5} $ . All strings consist only of lowercase English letters.

You need to output $ min(|s_{1}|,|s_{2}|,|s_{3}|) $ numbers separated by spaces — answers for the problem modulo $ 1000000007 (10^{9}+7) $ .

Consider a string $ t=t_{1}t_{2}...\ t_{|t|} $ , where $ t_{i} $ denotes the $ i $ -th character of the string, and $ |t| $ denotes the length of the string. Then $ t[i...\ j] $ $ (1