func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 3e5 + 10, size = 1 << 20, mod = 998244353, inf = 2e9;   const long long INF = 1e15;   template <class o>   void qr(o& x) {     char c = getchar();     x = 0;     int f = 1;     while (!isdigit(c)) {       if (c ==  - ) f = -1;       c = getchar();     }     while (isdigit(c)) x = x * 10 + c -  0 , c = getchar();     x *= f;   }   template <class o>   void qw(o x) {     if (x / 10) qw(x / 10);     putchar(x % 10 +  0 );   }   template <class o>   void pr1(o x) {     if (x < 0) x = -x, putchar( - );     qw(x);     putchar(   );   }   template <class o>   void pr2(o x) {     if (x < 0) x = -x, putchar( - );     qw(x);     putchar(  n );   }   long long gcd(long long a, long long b) { return !a ? b : gcd(b % a, a); }   long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }   long long power(long long a, long long b = mod - 2, long long p = mod) {     long long c = 1;     while (b) {       if (b & 1) c = c * a % p;       b /= 2;       a = a * a % p;     }     return c;   }   template <class o>   void cmax(o& x, o y) {     if (x < y) x = y;   }   void cmax(int& x, int y) {     x = x - y >> 31 ? y : x;     ;   }   template <class o>   void cmin(o& x, o y) {     if (x > y) x = y;   }   void cmin(int& x, int y) { x = x - y >> 31 ? x : y; }   template <typename t1, typename t2>   void ad(t1& x, t2 y) {     x += y;     if (x >= mod) x -= mod;   }   template <typename t1, typename t2>   void dl(t1& x, t2 y) {     x -= y;     if (x < 0) x += mod;   }   int n, m;   int mx[N << 2];   void change(int x, int l, int r, int pos, int d) {     if (l == r) {       mx[x] = d;       return;     }     if (pos <= ((l + r) >> 1))       change((x << 1), l, ((l + r) >> 1), pos, d);     else       change((x << 1 | 1), ((l + r) >> 1) + 1, r, pos, d);     cmax(mx[x] = mx[(x << 1)], mx[(x << 1 | 1)]);   }   int ask(int x, int l, int r, int L, int R) {     if (L <= l && r <= R) return mx[x];     int s = 0;     if (L <= ((l + r) >> 1)) cmax(s, ask((x << 1), l, ((l + r) >> 1), L, R));     if (((l + r) >> 1) < R)       cmax(s, ask((x << 1 | 1), ((l + r) >> 1) + 1, r, L, R));     return s;   }   int trie[N][27], tot = 1, pos[N];   vector<int> name[N];   void insert(char* s, int now) {     int p = 1;     for (int i = 1; s[i]; i++) {       int c = s[i] -  a ;       if (!trie[p][c]) trie[p][c] = ++tot;       p = trie[p][c];     }     name[p].push_back(now);     pos[now] = p;   }   int fail[N];   void add(int x, int y);   void bfs() {     static int q[N], l, r;     q[l = r = 1] = 1;     for (int i = 0; i <= 25; i++) trie[0][i] = 1;     while (l <= r) {       int p = q[l++], x, y;       for (int c = 0; c <= 25; c++) {         x = trie[p][c];         if (!x) {           trie[p][c] = trie[fail[p]][c];           continue;         }         y = fail[p];         if (p == 1)           fail[x] = 1;         else           fail[x] = trie[fail[p]][c];         q[++r] = x;         add(fail[x], x);       }     }   }   int fa[N], dep[N], son[N], sz[N], top[N], dfn[N], id;   vector<int> e[N];   void add(int x, int y) { e[x].push_back(y); }   void dfs1(int x) {     sz[x] = ((int)name[x].size());     son[x] = 0;     for (int y : e[x]) {       fa[y] = x;       dep[y] = dep[x] + 1;       dfs1(y);       sz[x] += sz[y];       if (sz[y] > sz[son[x]]) son[x] = y;     }   }   int st[N], ed[N];   void dfs2(int x, int tp) {     top[x] = tp;     st[x] = id + 1;     for (int y : name[x]) dfn[y] = ++id;     ed[x] = id;     if (son[x]) dfs2(son[x], tp);     for (int y : e[x])       if (y ^ son[x]) dfs2(y, y);   }   int Max(int x) {     int ans = -1;     while (x) {       if (st[top[x]] <= ed[x]) cmax(ans, ask(1, 1, n, st[top[x]], ed[x]));       x = fa[top[x]];     }     return ans;   }   void solve() {     qr(n);     qr(m);     static char s[N];     for (int i = 1; i <= n; i++) {       scanf( %s , s + 1);       insert(s, i);     }     bfs();     dfs1(1);     dfs2(1, 1);     while (m--) {       int op, i, x;       qr(op);       if (op == 1) {         qr(i);         qr(x);         change(1, 1, n, dfn[i], x);       } else {         scanf( %s , s + 1);         int ans = -1;         for (int i = 1, p = 1; s[i]; i++) {           int c = s[i] -  a ;           p = trie[p][c];           cmax(ans, Max(p));         }         pr2(ans);       }     }   }   int main() {     int T = 1;     while (T--) solve();     return 0;   }   