#ifndef __MINMAX_H__
#define __MINMAX_H__

/* updated: 2019-10-05 */

#include <functional>

template <class T, class Pred = std::less<T>>
class MinMax {
	T value_m = T();

public:
	MinMax() = default;
	MinMax(const T& value);
	MinMax(const MinMax<T, Pred>& other) = default;

	MinMax<T, Pred>& operator=(const T& value);
	MinMax<T, Pred>& operator=(const MinMax<T, Pred>& other) = default;

	MinMax<T, Pred>& operator|=(const T& other);
	MinMax<T, Pred>& operator&=(const T& other);

	operator T() const;
	operator T&();
};

template<class T, class Pred>
MinMax<T, Pred>::MinMax(const T& value)
	: value_m(value) {
}

template<class T, class Pred>
MinMax<T, Pred>& MinMax<T, Pred>::operator=(const T& value) {
	value_m = value;
	return *this;
}

template<class T, class Pred>
MinMax<T, Pred>& MinMax<T, Pred>::operator|=(const T& other) {
	value_m = std::max(value_m, other, Pred());
	return *this;
}

template<class T, class Pred>
MinMax<T, Pred>& MinMax<T, Pred>::operator&=(const T& other) {
	value_m = std::min(value_m, other, Pred());
	return *this;
}

template<class T, class Pred>
MinMax<T, Pred>::operator T() const {
	return value_m;
}

template<class T, class Pred>
MinMax<T, Pred>::operator T&() {
	return value_m;
}

using MMInt = MinMax<int>;
using MMLL = MinMax<long long int>;
using MMDouble = MinMax<double>;

#endif
#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>

using namespace std;
using uint = uint32_t;
using LL = int64_t;
using ULL = uint64_t;
using PP = pair<LL, LL>;
template <typename T> using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
#define REP(i, a, n) for(LL i = (a), i##_max_ = (n); i < i##_max_; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##_min_ = (a); i >= i##_min_; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP { cin.tie(NULL); ios::sync_with_stdio(false); }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U> istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U> ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N> void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N> void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template <class T> T Next() { T buf; cin >> buf; return buf; }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h&& j >= 0 && j < w; }

#ifdef ONLY_MY_ENVIR
#include "Accumulator.h"
#include "Algebraic.h"
#include "BinaryMatrix.h"
#include "BinaryTree.h"
#include "Bipartite.h"
#include "BIT.h"
#include "Compressor.h"
#include "Decompositions.h"
#include "DiscreteLog.h"
#include "DynamicMod.h"
#include "Exponential.h"
#include "Factorization.h"
#include "FFT.h"
#include "FlowSolver.h"
#include "Geometric2D.h"
#include "Geometric2DFloat.h"
#include "Geometric3D.h"
#include "Geometric3DFloat.h"
#include "Graph.h"
#include "GraphUtil.h"
#include "Interpolation.h"
#include "IntMod.h"
#include "KDTree.h"
#include "LazySegmentTree.h"
#include "LIS.h"
#include "List.h"
#include "Math.h"
#include "MathUtil.h"
#include "Matrix.h"
#include "MinCostFlowSolver.h"
#include "MinMax.h"
#include "Numbers.h"
#include "Optimize.h"
#include "Permutation.h"
#include "Polynomial.h"
#include "Position.h"
#include "Random.h"
#include "Range.h"
#include "Rational.h"
#include "RuntimeMod.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "Sets.h"
#include "Shortest.h"
#include "SlidingWindow.h"
#include "SpanningTree.h"
#include "StringSearching.h"
#include "SuffixArray.h"
#include "SwitchList.h"
#include "Timer.h"
#include "Tree.h"
#include "TreeUtil.h"
#include "UnionFind.h"
#include "Util.h"
#include "VectorUtil.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>>(istream& ist, __int128& val) { LL tmp; ist >> tmp; val = tmp; return ist; }
ostream& operator<<(ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif


string s;
int l;
MMInt dp[302][302][302];
int main() {
	cin >> s >> l;
	int n = s.size();

	REP(i, 0, n) {
		REP(j, 0, n) {
			if (i + j > n) continue;
			REP(k, 0, l + 1) {
				int nk = k + (s[i] != s[n - 1 - j]);
				if (i < n && j < n) dp[i + 1][j + 1][nk] |= (int)dp[i][j][k] + 2;
				if (i < n) dp[i + 1][j][k] |= dp[i][j][k];
				if (j < n) dp[i][j + 1][k] |= dp[i][j][k];
			}
		}
	}

	MMInt mx = 0;
	REP(i, 0, n) {
		REP(j, 0, n) {
			if (i + j > n) continue;
			REP(k, 0, l + 1) {
				mx |= (int)dp[i][j][k] + (i + j < n);
			}
		}
	}
	cout << mx << endl;
	return 0;
}






Measured memory_bytes: 59068