#include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<iostream>

 #include<queue>

 #include<stack>

 #include<cmath>

 #include<algorithm>

 #include<malloc.h>

 using namespace std;

 #define clc(a,b) memset(a,b,sizeof(a))

 #define inf 0x3f3f3f3f

 const int N=;

 #define LL long long

 const double eps = 1e-;

 const double pi = acos(-);

  int g[][];

 inline int r(){

     int x=,f=;char ch=getchar();

     while(ch>''||ch<''){if(ch=='-') f=-;ch=getchar();}

     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

     return x*f;

 }

 int num[];

 int jude(){

     int ans=;

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

         ans+=(num[i]!=);

     }

     return ans;

 }

 char s[];

 int main(){

     int T,k;

     scanf("%d",&T);

     while(T--){

         clc(num,);

         scanf("%s",s+);

         scanf("%d",&k);

         int len=strlen(s+);

         int j=;

         LL ans=;

         for(int i=;i<=len;i++){

                while(jude()!=k){

                     j++;

                     if(j>len) goto l;

                     num[s[j]-'a']++;

                }

                if(j>len) break;

                num[s[i]-'a']--;

                ans+=len-j+;//這樣每次枚舉K個不同的字符串，不會有覆蓋的情況

         }

         l:;

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

     }

     return ;

 }

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<iostream>

 #include<queue>

 #include<stack>

 #include<cmath>

 #include<algorithm>

 #include<malloc.h>

 using namespace std;

 #define clc(a,b) memset(a,b,sizeof(a))

 #define inf 0x3f3f3f3f

 const int N=;

 #define LL long long

 const double eps = 1e-;

 const double pi = acos(-);

  int g[][];

 inline int r(){

     int x=,f=;char ch=getchar();

     while(ch>''||ch<''){if(ch=='-') f=-;ch=getchar();}

     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

     return x*f;

 }

 char s[];

 LL ans;

 int a[];

 int main(){

     int T;

     scanf("%d",&T);

     while(T--){

         clc(a,);

         scanf("%s",s+);

         int len=strlen(s+);

         int k;

         ans=;

         scanf("%d",&k);

         if(k==){

             ans=((len+)*len)/;

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

             continue;

         }

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

             a[i]=;

         }

         int l=;

         int j=;

         for(int i=;i<=len;i++){

             if(a[s[i]-'a']==){

                  a[s[i]-'a']++;

                  l++;

             }

             else

                 a[s[i]-'a']++;

             if(l>=k){

                 ans+=len-i+;

                 for(;j<i;j++){

                     a[s[j]-'a']--;

                     if(a[s[j]-'a']==){

                         l--;

                         j++;

                         break;

                     }

                     else{

                         ans+=len-i+;

                     }

                 }

             }

         }

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

     }

     return ;

 }