#include <bits/stdc++.h>
using namespace std;
const long long MAX = 100000;
const long long inf = 0x3f3f3f3f;
const double EPS = 1e-10;
const long long MOD = 1e9 + 7;
char s[100005];
long long inv[100005], p25[100005];
long long qst[100005], tq, table[100005];
long long quick_pow(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % MOD;
    a = a * a % MOD;
    b >>= 1;
  }
  return ans;
}
long long Inv(long long a) { return quick_pow(a, MOD - 2); }
void solve(long long ls) {
  if (tq == 0) return;
  long long mx = ls;
  for (long long i = 0ll; i < tq; ++i) mx = max(mx, qst[i]);
  long long C = 1;
  table[ls - 1] = 0;
  for (long long i = ls; i <= mx; ++i) {
    table[i] = (C * p25[i - ls] % MOD + table[i - 1] * 26 % MOD) % MOD;
    C = C * i % MOD * inv[i - ls + 1] % MOD;
  }
  for (long long i = 0; i < tq; ++i) {
    if (qst[i] < ls)
      printf("0\n");
    else
      printf("%lld\n", table[qst[i]]);
  }
}
int main() {
  long long q, ls, first, cmd, tot = 0;
  p25[0] = 1;
  for (long long i = 1; i <= MAX; ++i) {
    p25[i] = p25[i - 1] * 25ll % MOD;
    inv[i] = Inv(i);
  }
  scanf("%lld %s", &q, s);
  tq = 0;
  ls = strlen(s);
  while (q--) {
    scanf("%lld", &cmd);
    if (cmd == 1) {
      solve(ls);
      tq = 0;
      scanf("%s", s);
      ls = strlen(s);
    } else {
      long long n;
      scanf("%lld", &n);
      qst[tq++] = n;
    }
  }
  solve(ls);
  return 0;
}
