#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

const int N = ;

int n, k, ans;

int nxt[N];

char s[N];

void kmp(char *s, int len, int *nxt)

{

    for(int i = , j = ; i <= len; ++ i)

    {

        while(s[j + ] != s[i] && j) j = nxt[j];

        if(s[j + ] == s[i]) ++ j;

        nxt[i] = j;

    }

}

int main()

{

    scanf("%s%d", s + , &k);

    n = strlen(s + );

    for(int i = ; i <= n; ++i)

    {

        char t[N];

        int len = ;

        for(int j = i; j <= n; ++j) t[++ len] = s[j];

        kmp(t, len, nxt);

        for(int j = i; j <= n; ++j)

        {

            int p = j - i + ;

            while(p *  >= j - i +  && p >= k) p = nxt[p];

            if(p *  < j - i +  && p >= k) ++ ans;

        }

    }

    printf("%d\n", ans);

    return ;

}