#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 15050
#define inf 1000000007
using namespace std;
int l,k,nxt[maxn],mn[maxn],ans=0;
char s[maxn];
void kmp(int x)
{
    int cnt=0;nxt[1]=0;
    if (k==1) mn[1]=1;
    for (int i=x+1;i<=l;i++)
    {
        while (cnt && s[i-1]!=s[x-1+cnt])
            cnt=nxt[cnt];
        if (s[i-1]==s[x-1+cnt]) cnt++;
        nxt[i-x+1]=cnt;
        if (nxt[i-x+1]<k) mn[i-x+1]=inf;
        else mn[i-x+1]=min(nxt[i-x+1],mn[nxt[i-x+1]]);
        if (mn[i-x+1]*2<(i-x+1)) ans++;
    }
}
int main()
{
    scanf("%s",s);l=strlen(s);
    scanf("%d",&k);
    for (int i=0;i<=k-1;i++) mn[i]=inf;
    for (int i=1;i<=l-2*k;i++)
        kmp(i);
    printf("%d\n",ans);
    return 0;
}