#include <bits/stdc++.h>
using namespace std;
const int MOD = ((int)1e9) + 7;
using ll = long long;
const int N = ((int)1e5) + 10;
ll iv[N];
ll ft[N], ift[N];
void init_inv() {
  iv[0] = iv[1] = 1;
  for (int i = 2; i < N; i++) iv[i] = (MOD - MOD / i) * iv[MOD % i] % MOD;
  ft[0] = ft[1] = 1;
  for (int i = 2; i < N; i++) ft[i] = ft[i - 1] * i % MOD;
  ift[0] = ift[1] = 1;
  for (int i = 2; i < N; i++) ift[i] = ift[i - 1] * iv[i] % MOD;
}
ll nck(int n, int k) { return ft[n] * ift[k] % MOD * ift[n - k] % MOD; }
const int X = 25;
const int C = 90;
ll p25[N], p26[N];
vector<int*> base;
void init() {
  init_inv();
  p25[0] = 1;
  for (int i = 0; i < (N - 1); i++) p25[i + 1] = p25[i] * X % MOD;
  p26[0] = 1;
  for (int i = 0; i < (N - 1); i++) p26[i + 1] = p26[i] * (X + 1) % MOD;
  for (int i = 0; i <= ((int)1e5); i += C) {
    base.emplace_back();
    auto& v = base.back();
    v = (int*)malloc(sizeof(int) * (i + 1));
    v[0] = 1;
    for (int j = 1; j <= i; j++) {
      ll cur_nck = nck(i, j) * p25[j] % MOD;
      ll nv = v[j - 1] + cur_nck;
      v[j] = nv % MOD;
    }
  }
}
int memo[C + 1][C + 1];
int geta1, geta2;
int* fmemo(int a, int b) { return memo[geta1 - a] + geta2 - b; }
int solve_core(int n, int k) {
  if (k < 0) return 0;
  if (k == 0) return 1;
  if (n == k) return (int)p26[n];
  if (n % C == 0) {
    int idx = n / C;
    return base[idx][k];
  }
  int* it = fmemo(n, k);
  if (*it != -1) return *it;
  ll a = solve_core(n - 1, k - 1);
  ll b = solve_core(n - 1, k);
  int ans = (X * a + b) % MOD;
  return *fmemo(n, k) = ans;
}
int solve(int n, int k) {
  if (k < 0) return 0;
  memset(memo, -1, sizeof(memo));
  int idx = n / C;
  geta1 = n;
  geta2 = k;
  return solve_core(n, k);
}
char buf[N];
int main() {
  init();
  int m;
  scanf("%d", &m);
  int len;
  scanf("%s", buf);
  len = strlen(buf);
  for (int i = 0; i < (m); i++) {
    int t;
    scanf("%d", &t);
    if (t == 1) {
      len = scanf("%s", buf);
      len = strlen(buf);
    } else {
      int n;
      scanf("%d", &n);
      ll ans = solve(n, n - len);
      printf("%d\n", (int)ans);
    }
  }
}
