#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];
vector<pair<long long, long long> > g[100005];
long long ans[100005], inv[100005], p25[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); }
int main() {
  long long q, ls, first, cmd, tot = 0;
  scanf("%lld %s", &q, s);
  ls = strlen(s);
  while (q--) {
    scanf("%lld", &cmd);
    if (cmd == 1) {
      scanf("%s", s);
      ls = strlen(s);
    } else {
      long long n;
      scanf("%lld", &n);
      g[ls].push_back({n, ++tot});
    }
  }
  p25[0] = 1;
  for (long long i = 1; i <= MAX; ++i) {
    p25[i] = p25[i - 1] * 25ll % MOD;
    inv[i] = Inv(i);
  }
  for (long long first = 1; first <= MAX; ++first) {
    if (g[first].size() == 0) continue;
    sort(g[first].begin(), g[first].end());
    long long top = g[first].size();
    long long mx = g[first][top - 1].first;
    long long C = 1, F = 0, now = 0;
    while (g[first][now].first < first && now < top) {
      long long th = g[first][now].second;
      ans[th] = 0ll;
      now++;
    }
    for (long long i = first; i <= mx; ++i) {
      F = (C * p25[i - first] % MOD + F * 26 % MOD) % MOD;
      C = C * i % MOD * inv[i - first + 1] % MOD;
      while (g[first][now].first == i && now < top) {
        long long th = g[first][now].second;
        ans[th] = F;
        now++;
      }
    }
  }
  for (int i = 1; i <= tot; ++i) {
    printf("%lld\n", ans[i]);
  }
  return 0;
}
