Problem: 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!

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 3 ⋅ 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 ≤ i ≤ n, 0 ≤ x ≤ 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 ⋅ 10^5. The total length of the strings q doesn't exceed 3 ⋅ 10^5. 

Output

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.

Examples

Input


5 8
kurou
takuo
takeshi
naomi
shingo
2 nakiraomi
2 abanaomicaba
1 3 943
2 takuotakeshishingo
1 5 135832
2 shingotakeshi
1 5 0
2 shingotakeshi


Output


-1
0
943
135832
943


Input


6 15
a
ab
ba
b
a
ba
2 aa
1 4 4
2 bbb
1 2 1
1 2 18
2 b
2 c
1 6 10
2 aba
2 abbbba
1 2 12
2 bbaaab
1 1 11
1 5 5
2 baa


Output


0
4
4
-1
18
18
12
11

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int N = 3e5 + 100;
char s[N];
int fail[N], trie[N][26], a[N], cnt = 0;
multiset<int> mmax[N];
int rk[N];
void insert_word(int id) {
  int len = strlen(s);
  int pos = 0;
  for (int i = 0; i < len; i++) {
    int to = s[i] - 'a';
    if (!trie[pos][to]) trie[pos][to] = ++cnt;
    pos = trie[pos][to];
  }
  mmax[pos].insert(0);
  rk[id] = pos;
}
void getfail() {
  queue<int> q;
  for (int i = 0; i < 26; i++) {
    if (trie[0][i]) {
      fail[trie[0][i]] = 0;
      q.push(trie[0][i]);
    }
  }
  while (!q.empty()) {
    int cur = q.front();
    q.pop();
    for (int i = 0; i < 26; i++) {
      if (trie[cur][i]) {
        fail[trie[cur][i]] = trie[fail[cur]][i];
        q.push(trie[cur][i]);
      } else
        trie[cur][i] = trie[fail[cur]][i];
    }
  }
}
vector<int> node[N];
int son[N], fa[N], num[N];
void dfs1(int u, int f) {
  son[u] = 0;
  fa[u] = f;
  num[u] = 1;
  for (auto v : node[u]) {
    if (v == f) continue;
    dfs1(v, u);
    num[u] += num[v];
    if (!son[u] || num[son[u]] < num[v]) son[u] = v;
  }
}
int top[N], id[N], idd[N], tot;
void dfs2(int u, int root) {
  top[u] = root;
  id[u] = ++tot;
  idd[tot] = u;
  if (son[u]) dfs2(son[u], root);
  for (int i = 0; i < node[u].size(); i++) {
    int v = node[u][i];
    if (v == fa[u] || v == son[u]) continue;
    dfs2(v, v);
  }
}
struct Node {
  int l, r, mmax;
} tree[N << 2];
void pushup(int k) {
  tree[k].mmax = max(tree[k << 1].mmax, tree[k << 1 | 1].mmax);
}
void build(int k, int l, int r) {
  tree[k].l = l;
  tree[k].r = r;
  if (l == r) {
    tree[k].mmax = *mmax[idd[l]].rbegin();
    return;
  }
  int mid = l + r >> 1;
  build(k << 1, l, mid);
  build(k << 1 | 1, mid + 1, r);
  pushup(k);
}
void update(int k, int pos, int val) {
  if (tree[k].l == tree[k].r) {
    tree[k].mmax = val;
    return;
  }
  int mid = tree[k].l + tree[k].r >> 1;
  if (mid >= pos)
    update(k << 1, pos, val);
  else
    update(k << 1 | 1, pos, val);
  pushup(k);
}
int query(int k, int l, int r) {
  if (tree[k].r < l || tree[k].l > r) return -inf;
  if (tree[k].l >= l && tree[k].r <= r) return tree[k].mmax;
  return max(query(k << 1, l, r), query(k << 1 | 1, l, r));
}
void update(int x) { update(1, id[x], *mmax[x].rbegin()); }
int query(int x) {
  int ans = -inf;
  while (top[x] != 0) {
    ans = max(ans, query(1, id[top[x]], id[x]));
    x = fa[top[x]];
  }
  ans = max(ans, query(1, id[0], id[x]));
  return ans;
}
int search_word() {
  int ans = -inf;
  int pos = 0;
  for (int i = 0; s[i]; i++) {
    int to = s[i] - 'a';
    pos = trie[pos][to];
    ans = max(ans, query(pos));
  }
  return ans;
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%s", s);
    insert_word(i);
  }
  getfail();
  mmax[0].insert(-1);
  for (int i = 1; i <= cnt; i++) {
    node[fail[i]].push_back(i);
    mmax[i].insert(-1);
  }
  dfs1(0, -1);
  dfs2(0, 0);
  build(1, 1, tot);
  while (m--) {
    int op;
    scanf("%d", &op);
    if (op == 1) {
      int pos, val;
      scanf("%d%d", &pos, &val);
      mmax[rk[pos]].erase(mmax[rk[pos]].find(a[pos]));
      a[pos] = val;
      mmax[rk[pos]].insert(a[pos]);
      update(rk[pos]);
    } else {
      scanf("%s", s);
      printf("%d\n", search_word());
    }
  }
  return 0;
}