CF1437G.Death DBMS

For the simplicity, let's say that the "Death Note" is a notebook that kills a person when their name is written in it.

It's easy to kill with it, but it's pretty hard to keep track of people you haven't killed and still plan to. You decided to make a "Death Database Management System" — a computer program that provides the easy access to the database of possible victims. Let me describe its specifications to you.

Let's define a victim entity: a victim has a name (not necessarily unique) that consists only of lowercase Latin letters and an integer suspicion value.

At the start of the program the user enters a list of $n$ victim names into a database, each suspicion value is set to $0$.

Then the user makes queries of two types:

• $1~i~x$ — set the suspicion value of the $i$-th victim to $x$;
• $2~q$ — given a string $q$ find the maximum suspicion value of a victim whose name is a contiguous substring of $q$.

Just to remind you, this program doesn't kill people, it only helps to search for the names to write down in an actual notebook. Thus, the list of the victims in the database doesn't change throughout the queries.

What are you waiting for? Write that program now!

为简化起见，我们称“死亡笔记”是一种笔记本：只要在其中写下某人的名字，此人便会死亡。

使用它杀人很容易，但要持续追踪那些尚未被杀死、却仍计划要杀掉的人，则相当困难。因此，你决定开发一套“死亡数据库管理系统”——一个便于访问潜在受害者数据库的计算机程序。下面为你介绍该系统的具体规格要求。

我们定义一个“受害者”实体：每个受害者拥有一个名字（名字不一定唯一），该名字仅由小写拉丁字母组成，并附有一个整数型的“嫌疑值”。

程序启动时，用户首先向数据库中输入 $n$ 个受害者的名字，此时所有受害者的嫌疑值均初始化为 $0$。

随后，用户可执行两类查询操作：

• $1~i~x$ —— 将第 $i$ 个受害者的嫌疑值设为 $x$；
• $2~q$ —— 给定一个字符串 $q$，找出所有名字是 $q$ 的连续子串的受害者中，最大的嫌疑值。

需要再次强调：该程序本身不会杀人，它仅辅助用户搜索出应写入真实死亡笔记中的名字。因此，数据库中受害者名单在整个查询过程中保持不变。

还等什么？立刻编写这个程序吧！

The first line contains two integers $n$ and $m$ ($1 \le n, m \le 3 \cdot 10^5$) — the number of victims and the number of queries, respectively.

Each of the next $n$ lines contains a single string $s_i$ — the name of the $i$-th victim. Each name consists only of lowercase Latin letters.

Each of the next $m$ lines contains a query of one of two types:

• $1~i~x$ ($1 \le i \le n$, $0 \le x \le 10^9$) — change the suspicion value of the $i$-th victim to $x$;
• $2~q$ — given a string $q$ consisting only of lowercase Latin letters find the maximum suspicion value of a victim whose name is a contiguous substring of $q$.

There is at least one query of the second type. The total length of the strings $s_i$ doesn't exceed $3 \cdot 10^5$. The total length of the strings $q$ doesn't exceed $3 \cdot 10^5$.

第一行包含两个整数 $n$ 和 $m$（$1 \le n, m \le 3 \cdot 10^5$），分别表示受害者人数和查询次数。

接下来的 $n$ 行，每行包含一个字符串 $s_i$，表示第 $i$ 个受害者的姓名。每个姓名仅由小写拉丁字母组成。

再接下来的 $m$ 行，每行包含以下两种类型之一的查询：

• $1~i~x$（$1 \le i \le n$，$0 \le x \le 10^9$）—— 将第 $i$ 个受害者的嫌疑值修改为 $x$；
• $2~q$ —— 给定一个仅由小写拉丁字母组成的字符串 $q$，求所有姓名是 $q$ 的连续子串的受害者中，最大的嫌疑值。

保证至少存在一个第二类查询。所有字符串 $s_i$ 的总长度不超过 $3 \cdot 10^5$。所有字符串 $q$ 的总长度不超过 $3 \cdot 10^5$。

For each query of the second type print an integer value. If there is no victim name that is a contiguous substring of $q$, then print $-1$. Otherwise, print the maximum suspicion value of a victim whose name is a contiguous substring of $q$.

对于每个第二类查询，请输出一个整数值：若不存在某个受害者姓名是 $q$ 的连续子串，则输出 $-1$；否则，输出所有姓名为 $q$ 的连续子串的受害者的最大嫌疑值。