#include <bits/stdc++.h>
using namespace std;
const long long MOD = (long long)1e9 + 7;
long long fact[100005], revfact[100005], st25[100005], st26[100005],
    revst26[100005];
bool used[100005];
long long answer[100005], pref[100005];
vector<pair<int, int> > quer[100005];
long long binpow(long long first, int step) {
  if (step == 0) return 1;
  if (step % 2 == 0) {
    long long t = binpow(first, step / 2);
    return t * t % MOD;
  } else
    return binpow(first, step - 1) * first % MOD;
}
long long C(int n, int k) {
  return fact[n] * revfact[k] % MOD * revfact[n - k] % MOD;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int m;
  string str;
  cin >> m >> str;
  int s = (int)str.length();
  fact[0] = 1;
  for (int i = 1; i <= 100000; i++) fact[i] = fact[i - 1] * (long long)i % MOD;
  revfact[100000] = binpow(fact[100000], MOD - 2);
  for (int i = 99999; i >= 0; i--)
    revfact[i] = revfact[i + 1] * (long long)(i + 1) % MOD;
  st25[0] = 1, st26[0] = 1;
  for (int i = 1; i <= 100000; i++)
    st25[i] = st25[i - 1] * 25 % MOD, st26[i] = st26[i - 1] * 26 % MOD;
  revst26[100000] = binpow(st26[100000], MOD - 2);
  for (int i = 99999; i >= 0; i--) revst26[i] = revst26[i + 1] * 26 % MOD;
  for (int i = 1; i <= m; i++) {
    int typ;
    cin >> typ;
    if (typ == 1) {
      cin >> str;
      s = (int)str.length();
    } else {
      int n;
      cin >> n;
      quer[s].push_back(make_pair(n, i));
      used[i] = true;
    }
  }
  for (int i = 1; i <= 100000; i++) {
    if (quer[i].empty()) continue;
    pref[i - 1] = 0;
    for (int k = i; k <= 100000; k++)
      pref[k] = (pref[k - 1] +
                 st25[k - i] * revst26[k] % MOD * C(k - 1, i - 1) % MOD) %
                MOD;
    for (int j = 0; j < (int)quer[i].size(); j++) {
      int n = quer[i][j].first, num = quer[i][j].second;
      if (n >= i)
        answer[num] = pref[n] * st26[n] % MOD;
      else
        answer[num] = 0;
    }
  }
  for (int i = 1; i <= m; i++)
    if (used[i]) cout << answer[i] << '\n';
  return 0;
}
