Takahashi has decided to give a string to his mother.

The value of a string T is the length of the longest common subsequence of T and T', where T' is the string obtained by reversing T. That is, the value is the longest length of the following two strings that are equal: a subsequence of T (possibly non-contiguous), and a subsequence of T' (possibly non-contiguous).

Takahashi has a string S. He wants to give her mother a string of the highest possible value, so he would like to change at most K characters in S to any other characters in order to obtain a string of the highest possible value. Find the highest possible value achievable.

Constraints

* 1 \leq |S| \leq 300
* 0 \leq K \leq |S|
* S consists of lowercase English letters.
* K is an integer.

Input

Input is given from Standard Input in the following format:


S
K


Output

Print the highest possible value achievable.

Examples

Input

abcabcabc
1


Output

7


Input

atcodergrandcontest
3


Output

15
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        MyScan in = new MyScan(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        public void solve(int testNumber, MyScan in, PrintWriter out) {
            String s = in.next();
            int k = in.nextInt();
            int[][][] pos = new int[k + 1][s.length() + 1][s.length()];

            for (int i = 0; i < s.length(); i++) {
                pos[0][1][i] = 1;
            }
            for (int r = 2; r <= s.length(); r++) {
                for (int l = 0; l <= s.length() - r; l++) {
                    int e = l + r - 1;
                    boolean match = s.charAt(l) == s.charAt(e);
                    if (match) {
                        for (int i = 0; i <= k; i++) {
                            pos[i][r][l] = Math.max(2 + pos[i][r - 2][l + 1], pos[i][r][l]);
                        }
                    } else {
                        for (int i = 0; i <= k; i++) {
                            pos[i][r][l] = Math.max(pos[i][r][l], pos[i][r - 1][l]);
                            pos[i][r][l] = Math.max(pos[i][r - 1][l + 1], pos[i][r][l]);
                        }
                        for (int i = 0; i < k; i++) {
                            pos[i + 1][r][l] = Math.max(pos[i + 1][r][l], 2 + pos[i][r - 2][l + 1]);
                        }
                    }
                }
            }
            int max = 0;
            for (int l = 0; l <= k; l++) {
                max = Math.max(max, pos[l][s.length()][0]);
            }
            out.println(max);


        }

    }

    static class MyScan {
        BufferedReader br;
        StringTokenizer st;

        MyScan(BufferedReader br) {
            this.br = br;
        }

        public MyScan(InputStream in) {
            this(new BufferedReader(new InputStreamReader(in)));
        }

        public void findToken() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
        }

        public String next() {
            findToken();
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

