func_code_string: #include <bits/stdc++.h>   using namespace std;   const int MOD = (int)1e9 + 7;   const int INF = (int)1e9;   const long long LINF = (long long)1e18;   const long double PI = acos((long double)-1);   const long double EPS = 1e-9;   inline long long gcd(long long a, long long b) {     long long r;     while (b) {       r = a % b;       a = b;       b = r;     }     return a;   }   inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }   inline long long fpow(long long n, long long k, int p = MOD) {     long long r = 1;     for (; k; k >>= 1) {       if (k & 1) r = r * n % p;       n = n * n % p;     }     return r;   }   template <class T>   inline int chkmin(T& a, const T& val) {     return a > val ? a = val, 1 : 0;   }   template <class T>   inline int chkmax(T& a, const T& val) {     return a < val ? a = val, 1 : 0;   }   inline long long isqrt(long long k) {     long long r = sqrt(k) + 1;     while (r * r > k) r--;     return r;   }   inline long long icbrt(long long k) {     long long r = cbrt(k) + 1;     while (r * r * r > k) r--;     return r;   }   inline void addmod(int& a, int val, int p = MOD) {     if ((a = (a + val)) >= p) a -= p;   }   inline void submod(int& a, int val, int p = MOD) {     if ((a = (a - val)) < 0) a += p;   }   inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }   inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }   const int maxn = 100010;   const int magic = 320;   int fac[maxn];   int rfac[maxn];   int f[maxn];   int p25[maxn];   int binomial(int a, int b) {     if (!a || a == b) {       return 1;     }     return mult(fac[b], mult(rfac[a], rfac[b - a]));   }   void solve() {     fac[0] = 1;     for (int i = (1); i < (maxn); i++) fac[i] = mult(fac[i - 1], i);     for (int i = (0); i < (maxn); i++) rfac[i] = inv(fac[i]);     p25[0] = 1;     for (int i = (1); i < (maxn); i++) p25[i] = mult(p25[i - 1], 25);     int m, k;     cin >> m;     string s;     cin >> s;     if ((k = int((s).size())) > magic) memset(f, -1, sizeof(f));     while (m--) {       int op;       cin >> op;       if (op == 1) {         string s;         cin >> s;         if ((k = int((s).size())) > magic) memset(f, -1, sizeof(f));       } else {         int n;         cin >> n;         if (n < k) {           cout << 0 <<   n ;           continue;         }         if (k > magic && ~f[n]) {           cout << f[n] <<   n ;           continue;         }         int res = fpow(26, n);         for (int i = (0); i < (k); i++) {           submod(res, mult(binomial(i, n), p25[n - i]));         }         if (k > magic) f[n] = res;         cout << res <<   n ;       }     }   }   int main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     solve();     return 0;   }   