Problem: The famous sculptor Cicasso is a Reberlandian spy!

These is breaking news in Berlandian papers today. And now the sculptor is hiding. This time you give the shelter to the maestro. You have a protected bunker and you provide it to your friend. You set the security system in such way that only you can open the bunker. To open it one should solve the problem which is hard for others but is simple for you.

Every day the bunker generates a codeword s. Every time someone wants to enter the bunker, integer n appears on the screen. As the answer one should enter another integer — the residue modulo 109 + 7 of the number of strings of length n that consist only of lowercase English letters and contain the string s as the subsequence.

The subsequence of string a is a string b that can be derived from the string a by removing some symbols from it (maybe none or all of them). In particular any string is the subsequence of itself. For example, the string "cfo" is the subsequence of the string "codeforces".

You haven't implemented the algorithm that calculates the correct answers yet and you should do that ASAP.

Input

The first line contains integer m (1 ≤ m ≤ 105) — the number of the events in the test case.

The second line contains nonempty string s — the string generated by the bunker for the current day.

The next m lines contain the description of the events. The description starts from integer t — the type of the event.

If t = 1 consider a new day has come and now a new string s is used. In that case the same line contains a new value of the string s.

If t = 2 integer n is given (1 ≤ n ≤ 105). This event means that it's needed to find the answer for the current string s and the value n.

The sum of lengths of all generated strings doesn't exceed 105. All of the given strings consist only of lowercase English letters.

Output

For each query of the type 2 print the answer modulo 109 + 7 on the separate line.

Example

Input

3
a
2 2
1 bc
2 5


Output

51
162626

Note

In the first event words of the form "a?" and "?a" are counted, where ? is an arbitrary symbol. There are 26 words of each of these types, but the word "aa" satisfies both patterns, so the answer is 51.

Solution (in JAVA):

Solution:
import java.text.DecimalFormat;
import java.util.*;
import java.io.*;

public class Main {
    private static final int mod = 1000000007;
    private static final int MAX = 100*1000;
    private static int [] fact,invi,invf;
    private static int [] p25,p26;

    private static int mul(int a,int b) {
        long ret = a*(long)b;
        return (int)(ret%mod);
    }

    private static int add(int a,int b) {
        a += b;
        if (a >= mod) a -= mod;
        return a;
    }

    private static void init() throws Exception{
        fact = new int[MAX+1];
        fact[0] = 1;
        for (int i = 1;i <= MAX;i++)
            fact[i] = mul(fact[i-1],i);

        invi = new int[MAX+1];
        invi[1] = 1;
        for (int i = 2;i <= MAX;i++){
            invi[i] = mul(mod - mod/i,invi[mod%i]);
            if (mul(i,invi[i]) != 1)
                throw new Exception(i + ". " + invi[i]);
        }

        invf = new int[MAX+1];
        invf[0] = 1;
        for (int i = 1;i <= MAX;i++)
            invf[i] = mul(invf[i-1],invi[i]);


        p25 = new int[MAX+1];
        p25[0] = 1;
        for (int i = 1;i <= MAX;i++)
            p25[i] = mul(p25[i-1],25);

        p26 = new int[MAX+1];
        p26[0] = 1;
        for (int i = 1;i <= MAX;i++)
            p26[i] = mul(p26[i-1],26);
    }

    private static int C(int n,int k) {
        if (k > n) return 0;
        int ret = fact[n];
        ret = mul(ret,invf[k]);
        ret = mul(ret,invf[n-k]);
        return ret;
    }


    public static void main(String[] args) throws Exception {
        IO io = new IO(null, null);
        init();
        int m = io.getNextInt();
        int len = io.getNext().length();
        HashMap<Integer, Integer>[] memo = new HashMap[MAX + 1];
        ArrayList<Integer>[] Q = new ArrayList[MAX + 1];

        ArrayList<Integer> qN = new ArrayList<>(m);

        for (int q = 1, c = 0; q <= m; q++) {
            int t = io.getNextInt();
            if (t == 1) len = io.getNext().length();
            else {
                int n = io.getNextInt();
                qN.add(n);
                if (Q[len] == null) Q[len] = new ArrayList<>();
                Q[len].add(c++);
            }
        }

        int[] ans = new int[qN.size()];

        for (len = 1; len <= MAX; len++){
            if (Q[len] != null) {
                Collections.sort(Q[len], new Comparator<Integer>() {
                    @Override
                    public int compare(Integer a, Integer b) {
                        return qN.get(a) - qN.get(b);
                    }
                });

                int v = 0, n = len - 1;
                for (int q : Q[len]) {
                    int tn = qN.get(q);
                    while (n < tn) {
                        ++n;
                        v = mul(v, 26);
                        int tmp = C(n - 1, len - 1);
                        tmp = mul(tmp, p25[n - len]);
                        v = add(v, tmp);
                    }
//                    System.err.println(tn + ". " + v);
                    ans[q] = v;
                }

            }
        }

        for (int i = 0;i < ans.length;i++)
            io.println(ans[i]);

        io.close();
    }


}


class IO{
    private BufferedReader br;
    private StringTokenizer st;
    private PrintWriter writer;
    private String inputFile,outputFile;

    public boolean hasMore() throws IOException{
        if(st != null && st.hasMoreTokens()) return true;
        if(br != null && br.ready()) return true;
        return false;
    }

    public String getNext() throws FileNotFoundException, IOException{
        while(st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
        return st.nextToken();
    }

    public String getNextLine() throws FileNotFoundException, IOException{
        return br.readLine().trim();
    }

    public int getNextInt() throws FileNotFoundException, IOException{
        return Integer.parseInt(getNext());
    }
    public long getNextLong() throws FileNotFoundException, IOException{
        return Long.parseLong(getNext());
    }

    public void print(double x,int num_digits) throws  IOException{
        writer.printf("%." + num_digits + "f" ,x);
    }
    public void println(double x,int num_digits) throws  IOException{
        writer.printf("%." + num_digits + "f\n" ,x);
    }
    public void print(Object o) throws  IOException{
        writer.print(o.toString());
    }

    public void println(Object o) throws  IOException{
        writer.println(o.toString());
    }
    public IO(String x,String y) throws FileNotFoundException, IOException{
        inputFile = x;
        outputFile = y;
        if(x != null) br = new BufferedReader(new FileReader(inputFile));
        else br = new BufferedReader(new InputStreamReader(System.in));
        if(y != null) writer = new PrintWriter(new BufferedWriter(new FileWriter(outputFile)));
        else writer = new PrintWriter(new OutputStreamWriter(System.out));
    }

    protected void close() throws IOException{
        br.close();
        writer.close();
    }
    public void outputArr(Object [] A) throws IOException{
        int L = A.length;
        for (int i = 0;i < L;i++) {
            if(i > 0) writer.print(" ");
            writer.print(A[i]);
        }
        writer.print("\n");
    }
}