#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100001;
const int SQ = 316;
const long long MOD = 1000000007;
long long smallPower[SQ + 1][SQ + 1];
int largePower[MAXN / SQ + 1][MAXN];
char buf[MAXN];
void makeSum(int* arr, int len) {
  for (int i = 1; i < len; i++) arr[i] = (arr[i - 1] + arr[i]) % MOD;
}
int getsum(int* sum, int r) { return sum[r]; }
long long qpowmod(long long a, long long b, long long mod) {
  long long res = 1;
  while (b) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return res;
}
long long fact[MAXN];
long long rfact[MAXN];
long long pw[MAXN + 1];
long long cnk(long long n, long long k) {
  if (n < k) return 0;
  return fact[n] * rfact[k] % MOD * rfact[n - k] % MOD;
}
int main() {
  fact[0] = 1;
  for (int i = 1; i < MAXN; i++) fact[i] = fact[i - 1] * i % MOD;
  for (int i = 0; i < MAXN; i++) rfact[i] = qpowmod(fact[i], MOD - 2, MOD);
  pw[0] = 1;
  for (int i = 1; i < MAXN + 1; i++) pw[i] = pw[i - 1] * 25 % MOD;
  int m;
  scanf("%d", &m);
  scanf("%s", buf);
  int s = strlen(buf);
  smallPower[0][0] = 1;
  smallPower[1][0] = 25;
  smallPower[1][1] = 1;
  for (int i = 1; i < SQ; i++)
    for (int j = 0; j <= SQ; j++)
      smallPower[i + 1][j] =
          (smallPower[i][j] * 25 + (j > 0 ? smallPower[i][j - 1] : 0)) % MOD;
  for (int n = 0; n * SQ < MAXN; n++) {
    for (int j = 0; j <= n * SQ; j++) {
      largePower[n][j] = pw[n * SQ - j] * cnk(n * SQ, j) % MOD;
    }
    makeSum(largePower[n], MAXN);
  }
  while (m--) {
    int type;
    scanf("%d", &type);
    if (type == 1) {
      scanf("%s", buf);
      s = strlen(buf);
    } else {
      int n;
      scanf("%d", &n);
      int low = n % SQ;
      int hi = n / SQ;
      long long res = 0;
      for (int i = 0; i <= SQ; i++) {
        if (i < s)
          res = (res +
                 getsum(largePower[hi], s - i - 1) * smallPower[low][i] % MOD) %
                MOD;
      }
      res = qpowmod(26, n, MOD) - res;
      res = (res % MOD + MOD) % MOD;
      printf("%lld\n", res);
    }
  }
  return 0;
}
