B"Mahmoud and Ehab solved Dr. Evil's questions so he gave them the password of the door of the evil land. When they tried to open the door using it, the door gave them a final question to solve before they leave (yes, the door is digital, Dr. Evil is modern). If they don't solve it, all the work will be useless and they won't leave the evil land forever. Will you help them? Mahmoud and Ehab are given n strings s1, xe2 x80 x89s2, xe2 x80 x89... , xe2 x80 x89sn numbered from 1 to n and q queries, Each query has one of the following forms: (r xe2 x80 x89- xe2 x80 x89l xe2 x80 x89+ xe2 x80 x891) xe2 x80 x89* xe2 x80 x89LCP(sl, xe2 x80 x89sl xe2 x80 x89+ xe2 x80 x891, xe2 x80 x89... , xe2 x80 x89sr xe2 x80 x89- xe2 x80 x891, xe2 x80 x89sr) where LCP(str1, xe2 x80 x89str2, xe2 x80 x89str3, xe2 x80 x89... ) is the length of the longest common prefix of the strings str1, xe2 x80 x89str2, xe2 x80 x89str3, xe2 x80 x89... . The first line of input contains 2 integers n and q (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105, xe2 x80 x891 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89q xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105) xe2 x80 x93 The number of strings and the number of queries, respectively. The second line contains n strings stri consisting of lowercase English letters. The next q lines describe the queries and may have one of the 2 forms: the total length of all strings in input won't exceed 105 For each query of first type output its answer in a new line. "...