#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long MAXN = 1e5 + 10;
const long long SQ = 300;
long long n;
string s;
long long ss[2 * MAXN], c[MAXN], p25[MAXN], zss[MAXN];
long long d[SQ + 2][MAXN];
bool seen[2 * MAXN];
long long pw(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = (ret * a) % MOD;
    b >>= 1;
    a = (a * a) % MOD;
  }
  return ret;
}
long long cal(long long a, long long b) {
  return (ss[a] * zss[b] % MOD * zss[a - b] % MOD);
}
void proc() {
  if (seen[n] && n < SQ) return;
  seen[n] = 1;
  if (n < SQ) {
    d[n][0] = 1;
    for (long long i = 1; i < MAXN; i++)
      d[n][i] = (d[n][i - 1] * 26LL + p25[i] * cal(i + n - 1, n - 1)) % MOD;
  } else {
    c[0] = 1;
    for (long long i = 1; i < MAXN; i++)
      c[i] = (c[i - 1] * 26LL + p25[i] * cal(i + n - 1, n - 1)) % MOD;
  }
}
long long get(long long x) {
  if (n < SQ) return d[n][x];
  return c[x];
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  p25[0] = 1;
  for (int i = 1; i < MAXN; i++) p25[i] = (p25[i - 1] * 25LL) % MOD;
  zss[0] = 1;
  for (int i = 1; i < MAXN; i++) zss[i] = (zss[i - 1] * pw(i, MOD - 2)) % MOD;
  ss[0] = 1;
  for (long long i = 1; i < 2 * MAXN; i++) ss[i] = (ss[i - 1] * i) % MOD;
  long long q;
  cin >> q;
  cin >> s;
  n = s.size();
  proc();
  while (q--) {
    long long type;
    cin >> type;
    if (type == 1) {
      cin >> s, n = s.size();
      proc();
    } else {
      long long x;
      cin >> x;
      if (n > x)
        cout << "0\n";
      else
        cout << get(x - n) << "\n";
    }
  }
  return 0;
}
