#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>
#include <deque>
#include <queue>
#include <functional>
#include <chrono>
#include <stack>

using namespace std;

#define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double

ostream& operator<< (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << " ";
    return out;
}

istream& operator>> (istream& in, pii& b) {
    in >> b.first >> b.second;
    return in;
}

ostream& operator<< (ostream& out, const pii& b) {
    out << "{" << b.first << ", " << b.second << "}";
    return out;
}

template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}


#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << (x) << "\n";
    const int INF = 1e18;
    // const int mod = 2600000069;
    // const int p = 10;
#else
    #define dbg(x) 57
    const int INF = 1e18;
    // const int mod = 2600000069;
    // const int p = 179;
#endif

const ld PI = acos(-1);

#define time clock() / (double) CLOCKS_PER_SEC

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,sse3,sse4")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("fast-math")
// #pragma GCC target("avx2")  
// #pragma GCC optimize("section-anchors")
// #pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
// #pragma GCC optimize("vpt")
// #pragma GCC optimize("rename-registers")
// #pragma GCC optimize("move-loop-invariants")
// #pragma GCC optimize("unswitch-loops")
// #pragma GCC optimize("function-sections")
// #pragma GCC optimize("data-sections")

mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());

const int MAXN = 1e5 + 10;

int n, k;
vector<int> g[MAXN];
int ans = 0;
int d[MAXN];

void dfs(int v) {
    d[v] = 0;
    for (auto u : g[v]) {
        dfs(u);
        if (d[u] == k - 1 && v != 0) {
            ans++;
        } else {
            chkmax(d[v], d[u] + 1);
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> k;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        a[i]--;
    }
    if (k == 1) {
        for (int i = 0; i < n; i++) {
            if (a[i] != 0) {
                ans++;
            }
        }
        cout << ans << "\n";
        return 0;
    }
    if (a[0] != 0) {
        ans++;
        a[0] = 0;
    }
    for (int i = 1; i < n; i++) {
        g[a[i]].pb(i);
    }
    dfs(0);
    cout << ans << "\n";
}
/*

*/
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define N 305
using namespace std;

int n, k, dp[N][N][N];
char s[N];

int f(int bas, int son, int k){
	if(bas == son)
		return 1;
	if(bas > son)
		return 0;
	int &r = dp[bas][son][k];
	if(r != -1)
		return r;
	if(s[bas] == s[son])
		r = f(bas + 1, son - 1, k) + 2;
	if(k)
		r = max(r, f(bas + 1, son - 1, k - 1) + 2);
	r = max(r, f(bas + 1, son - 1, k));
	r = max(r, f(bas, son - 1, k));
	r = max(r, f(bas + 1, son, k));
	return r;
}

int main() {
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	memset(dp, -1, sizeof dp);
	scanf("%s %d",s + 1, &k);
	n = strlen(s + 1);
	printf("%d\n", f(1, n, k));
	return 0;
}