#include <bits/stdc++.h>
using namespace std;
vector<int> f[100010];
char s[100010];
int vis[100010], fac[100010], ff[100010], FF[100010];
int n, Q, x, ops, i;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch <= '9' && ch >= '0') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void write(int x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10) write(x / 10);
  putchar(x % 10 + '0');
}
inline int ksm(int x, int y) {
  if (!y) return 1;
  if (y == 1) return x;
  if (y & 1) return 1ll * x * ksm(1ll * x * x % 1000000007, y / 2) % 1000000007;
  return ksm(1ll * x * x % 1000000007, y / 2);
}
inline int C(int n, int m) {
  return 1ll * ff[n] * FF[m] % 1000000007 * FF[n - m] % 1000000007;
}
inline void work(int n) {
  int i, t;
  if (vis[n]) return;
  vis[n] = 1;
  for (i = 0; i <= n; i++) f[n].push_back(0);
  f[n][n] = 1;
  for (i = n + 1; i <= 100000; i++) {
    t = (1ll * f[n][i - 1] * 26 + 1ll * fac[i - n] * C(i - 1, n - 1)) %
        1000000007;
    f[n].push_back(t);
  }
}
int main() {
  Q = read();
  scanf("%s", s + 1);
  n = strlen(s + 1);
  fac[0] = 1;
  for (i = 1; i <= 100000; i++) fac[i] = 1ll * fac[i - 1] * 25 % 1000000007;
  ff[0] = 1;
  for (i = 1; i <= 100000; i++) ff[i] = 1ll * ff[i - 1] * i % 1000000007;
  FF[100000] = ksm(ff[100000], 1000000007 - 2);
  for (i = 100000; i; i--) FF[i - 1] = 1ll * FF[i] * i % 1000000007;
  work(n);
  while (Q) {
    Q--;
    ops = read();
    if (ops == 1) {
      scanf("%s", s + 1);
      n = strlen(s + 1);
      work(n);
      continue;
    }
    x = read();
    write(f[n][x]);
    puts("");
  }
}
