#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
using namespace std;
int p = 1000000007;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define rep(i,n) for(long long i=0;i<n;i++)
#define sor(v) sort(v.begin(),v.end())
#define mmax(a,b) a=max(a,b)
#define mmin(a,b) a=min(a,b)
#define mkp make_pair
#define pin pair<int,int>
#define V vector
#define Endl endl
#define veb vector<bool>
#define sq(a) (a)*(a)
#define rev(s) reverse(s.begin(),s.end())
#define end_program(s) cout << s <<endl;return 0
int kai_size = 1000001;
vel kai(kai_size, 1);
vel ink(kai_size, 1);
vel dist;
int RE() {
	vel v(3, 2);
	return v.at(4); 
}
int ru(int a, int r) {
	if (r == 0) { return 1; }
	int ans = ru(a, r / 2);
	ans *= ans; ans %= p;
	if (r % 2 == 1) { ans *= a; }
	return ans % p;
}
int inv(int a) {
	return ru(a, p - 2);
}
void make_kai() {
	rep(i, kai_size-1) { kai[i + 1] = (kai[i] * (i + 1)) % p; }
	rep(i, kai_size) { ink[i] = inv(kai[i]); }
}
int com(int n, int r) {
	if (r < 0 || n < r) { return 0; }
	int ans = kai[n] * ink[r];
	ans %= p; ans *= ink[n - r]; ans %= p;
	return ans;
}
vel dis(int mid1, vvel &way) {
	int n = way.size();
	vel dist(n, -1); dist[mid1] = 0;
	queue<int> q;
	q.push(mid1);
	while (!q.empty()) {
		int st = q.front(); q.pop();
		rep(i, way[st].size()) {
			int to = way[st][i];
			if (dist[to] == -1) {
				dist[to] = dist[st] + 1;
				q.push(to);
			}
		}
	}
	return dist;
}
pin most_far(int now, int n, vvel &way) {
	vel dist1 = dis(now, way);
	pin ans = mkp(-1, 0);
	rep(i, n) {
		if (dist1[i] > ans.first) { ans = mkp(dist1[i], i); }
	}
	return ans;
}

int per(int a, int b) {
	int ans = a % b;
	if (ans < 0) { ans += b; }
	return ans;
}
vel uni(vel &v) {
	sor(v);
	vel ans(1, v[0]);
	for (int i = 1; i < v.size(); i++) {
		if (v[i] != v[i-1]) { ans.push_back(v[i]); }
	}
	v = ans;
	return v;
}
int s_gcd(int a, int b) {
	if (b == 0) { return a; }
	return s_gcd(b, a%b);
}
int gcd(int a, int b) {
	if (a < b) { swap(a, b); }
	return s_gcd(a, b);
}
bool is_prime(int i) {
	for (int j = 2; j*j <= i; j++) {
		if (i%j == 0) { return false; }
	}
	return true;
}
int get(int i, int j, vvel &ans) {
	int n = ans.size();
	if (i < 0 || n <= i || j < 0 || n <= j) { return 1; }
	return ans[i][j];
}
int lcm(int a, int b) {
	return a * b / gcd(a, b);
}
signed main() {
	string s; cin >> s;
	int n = s.size();
	if (n == 1) { cout << 1 << endl; return 0; }
	int k; cin >> k;
	V<veb> can_use(n, veb(n));
	rep(i, n) {
		rep(j, n) {
			can_use[i][j] = (s[i] == s[n-1-j]);
		}
	}
	V<vvel> ans(n,vvel(n, vel(k+1, 0)));
	bool fl = false;
	rep(i, n) {
		fl =fl || can_use[0][i];
		if (fl) {
			if (i < n - 1) {
				ans[0][i][0] = 2;
			}
			else {
				ans[0][i][0] = 1;
				mmax(ans[0][i][0], ans[0][i - 1][0]);
			}
		}
		rep(use, k) {
			ans[0][i][use + 1] = 2;
		}
	}
	fl = false;
	rep(i, n) {
		fl = fl || can_use[i][0];
		if (fl) {
			if (i < n - 1) {
				ans[i][0][0] = 2;
			}
			else {
				ans[i][0][0] = 1;
				mmax(ans[0][i][0], ans[0][i - 1][0]);
			}
		}
		rep(use, k) {
			ans[i][0][use + 1] = 2;
		}
	}
	for (int i = 1; i < n; i++) {
		for (int j = 1; j < n; j++) {
			rep(use, k+1) {
				ans[i][j][use] = max(ans[i - 1][j][use], ans[i][j - 1][use]);
				if (can_use[i][j] and i+j<n-1) {
					mmax(ans[i][j][use], ans[i - 1][j - 1][use] + 2);
				}
				else if(can_use[i][j] and i + j == n - 1){
					mmax(ans[i][j][use], ans[i - 1][j - 1][use] + 1);
				}
				else if (use != 0 and i+j<n-1) {
					mmax(ans[i][j][use], ans[i - 1][j - 1][use-1] + 2);
				}
				else if (use != 0 and i + j == n - 1) {
					mmax(ans[i][j][use], ans[i - 1][j - 1][use - 1] + 1);
				}
			}
		}
	}
	int ret = 0;
	for (int i = 0; i < n; i++) {
		rep(use, k+1) {
			mmax(ret, ans[i][n-1 - i][use]);
		}
	}
	cout << ret << endl;
	return 0;
}


Measured memory_bytes: 231040