A11224 | Mahmoud and Ehab and the final stage

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 $s_{1},s_{2},...\ ,s_{n}$ numbered from $1$ to $n$ and $q$ queries, Each query has one of the following forms:

- $1$ $a$ $b$ $(1<=a<=b<=n)$ , For all the intervals $[l;r]$ where $(a<=l<=r<=b)$ find the maximum value of this expression: $(r-l+1)*LCP(s_{l},s_{l+1},...\ ,s_{r-1},s_{r})$ where $LCP(str_{1},str_{2},str_{3},...\ )$ is the length of the longest common prefix of the strings $str_{1},str_{2},str_{3},...$ .
- $2$ $x$ $y$ $(1<=x<=n)$ where $y$ is a string, consisting of lowercase English letters. Change the string at position $x$ to $y$ .

The first line of input contains 2 integers $n$ and $q$ $(1<=n<=10^{5},1<=q<=10^{5})$ – The number of strings and the number of queries, respectively.

The second line contains $n$ strings $str_{i}$ consisting of lowercase English letters.

The next $q$ lines describe the queries and may have one of the 2 forms:

- $1$ $a$ $b$ ( $1<=a<=b<=n$ ).
- $2$ $x$ $y$ ( $1<=x<=n$ ), where $y$ is a string consisting of lowercase English letters.

the total length of all strings in input won't exceed $10^{5}$

For each query of first type output its answer in a new line.