#include <iostream>

 #include <cstring>

 #include <cstdio>

 #include <algorithm>

 using namespace std;

 const int Maxn=;

 char S[Maxn];

 int k,P[Maxn],Ans;

 inline void Kmp(char * Str)

 {

     int j=;

     for (int i=;Str[i];i++)

     {

         while (Str[j+]!=Str[i] && j) j=P[j];

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

         P[i]=j;

     }

     j=;

     for (int i=;Str[i];i++)

     {

         while (Str[j+]!=Str[i] && j) j=P[j];

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

         while (j<<>=i) j=P[j];

         if (j>=k) Ans++;

     }

 }

 int main()

 {

     scanf("%s",S+);

     scanf("%d",&k);     Ans=;

     for (int i=;S[i+];i++) Kmp(S+i);

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

     return ;

 }
 

 #include <iostream>

 #include <cstring>

 #include <cstdio>

 #include <algorithm>

 #define LL long long

 using namespace std;

 const LL Maxn=;

 const LL Mod=;

 char S[Maxn];

 LL k,P[Maxn],Ans,Cnt[Maxn],Kase;

 inline void Kmp(char * Str)

 {

     LL j=;

     Cnt[]=;

     for (LL i=;Str[i];i++)

     {

         while (Str[j+]!=Str[i] && j) j=P[j];

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

         P[i]=j;

         Cnt[i]=Cnt[j]+;

     }

     j=; LL Ret;

     for (LL i=;Str[i];i++)

     {

         while (Str[j+]!=Str[i] && j) j=P[j];

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

         while (j<<>i) j=P[j];

         Ans=(Ans*(Cnt[j]+))%Mod;

     }

 }

 int main()

 {

     scanf("%lld",&Kase);

     for (LL kase=;kase<=Kase;kase++)

     {

         scanf("%s",S+);

         Ans=; Kmp(S);

         printf("%lld\n",Ans);

     }

     return ;

 }
 

 #include <iostream>

 #include <cstring>

 #include <cstdio>

 #include <algorithm>

 using namespace std;

 const int Maxn=;

 char S[Maxn],T[Maxn],Stack[Maxn];

 int Lens,Lent,P[Maxn],top,a[Maxn];

 int main()

 {

     scanf("%s",S+);

     scanf("%s",T+);

     Lens=strlen(S+),Lent=strlen(T+);

     int j=;

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

     {

         while (T[j+]!=T[i] && j) j=P[j];

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

         P[i]=j;

     }

     j=;

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

     {

         j=a[top]; Stack[++top]=S[i];

         while (T[j+]!=Stack[top] && j) j=P[j];

         if (T[j+]==Stack[top]) j++;

         a[top]=j;

         if (j==Lent) top-=Lent;

     }

     for (int i=;i<=top;i++) putchar(Stack[i]);

     putchar('\n');

     return ;

 }