#include <cstdio>

#include <cmath>

#include <cstring>

#include <iostream>

#include <algorithm>

#include <queue>

#include <vector>

#include <map>



using namespace std;



typedef long long LL;


int T,len,num,j;
LL ans;
char s[1000005];
int a[30];
int k;

int main()

{

    scanf("%d",&T);
    while (T--)
    {
        scanf("%s",s+1);
        len=strlen(s+1);
        scanf("%d",&k);
        num=0;j=0;ans=0;
        memset(a,0,sizeof(a));
        for (int i=1;i<=len;++i)
        {
            while (num<k&&j+1<=len)
            {
                ++j;
                a[s[j]-'a']++;
                if (a[s[j]-'a']==1) num++;
            }
            if (num==k)
            {
                ans+=len-j+1;
            }
            --a[s[i]-'a'];
            if (a[s[i]-'a']==0) --num;
        }
        printf("%I64d\n",ans);
    }    

    return 0;

}