#include <bits/stdc++.h>
using namespace std;
template <typename T>
void chkmax(T &x, T y) {
  x = x > y ? x : y;
}
template <typename T>
void chkmin(T &x, T y) {
  x = x > y ? y : x;
}
template <typename T>
void update(T &x, T y, T mod) {
  x = x + y > mod ? x + y - mod : x + y;
}
const int INF = (1ll << 30);
template <typename T>
void read(T &x) {
  x = 0;
  bool f = 1;
  char ch;
  do {
    ch = getchar();
    if (ch == '-') f = 0;
  } while (ch > '9' || ch < '0');
  do {
    x = x * 10 + ch - '0';
    ch = getchar();
  } while (ch >= '0' && ch <= '9');
  x = f ? x : -x;
}
template <typename T>
void write(T x) {
  if (x < 0) x = ~x + 1, putchar('-');
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
const int N = 1e5 + 7;
const int mod = 1e9 + 7;
struct Query {
  int n, len, id;
  Query(int nn = 0, int Len = 0, int ID = 0) {
    n = nn;
    len = Len;
    id = ID;
  }
  bool operator<(const Query &rhs) const {
    return (len < rhs.len) || (len == rhs.len && n < rhs.n);
  }
} q[N];
int T, n, opt, tot, len, f[N], pw[N], ans[N], fac[N], invfac[N];
char s[N];
inline int qpow(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % mod;
    a = 1ll * a * a % mod;
    b >>= 1;
  }
  return ret;
}
inline void init(int NN) {
  fac[0] = pw[0] = 1;
  for (int i = 1; i <= NN; i++)
    fac[i] = 1ll * fac[i - 1] * i % mod, pw[i] = 1ll * pw[i - 1] * 25 % mod;
  invfac[NN] = qpow(fac[NN], mod - 2);
  for (int i = NN - 1; i >= 0; i--)
    invfac[i] = 1ll * invfac[i + 1] * (i + 1) % mod;
}
inline int C(int n, int m) {
  return 1ll * fac[n] * invfac[n - m] % mod * invfac[m] % mod;
}
inline void calc(int n, int len) {
  for (int i = 0; i < len; i++) f[i] = 0;
  f[len] = 1;
  for (int i = len + 1; i <= n; i++) {
    f[i] =
        1ll * f[i - 1] * 26 % mod + 1ll * C(i - 1, len - 1) * pw[i - len] % mod;
    f[i] %= mod;
  }
}
inline void solve() {
  sort(q + 1, q + tot + 1);
  for (int i = 1; i <= tot; i++) {
    if (q[i].len == q[i - 1].len)
      ans[q[i].id] = f[q[i].n];
    else {
      int j = i;
      while (j <= tot && q[j].len == q[i].len) j++;
      calc(q[j - 1].n, q[i].len);
      ans[q[i].id] = f[q[i].n];
    }
  }
  for (int i = 1; i <= tot; i++) printf("%d\n", ans[i]);
}
int main() {
  read(T);
  scanf("%s", s);
  len = strlen(s);
  init(1e5);
  while (T--) {
    read(opt);
    if (opt == 1) {
      scanf("%s", s);
      len = strlen(s);
    } else {
      scanf("%d", &n);
      ++tot;
      q[tot] = Query(n, len, tot);
    }
  }
  solve();
  return 0;
}
