#include<cstdio>
#include<cmath>
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<vector>
#include<list>
#define pi 4*atan(1)
#define eps 1e-10
#define INF 0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define FF(i,n) for(int i = 0 ; i < n ; i++)
#define F(i,n) for(int i = 1 ; i <= n ; i++)
#define maxn 100000+10
#define mod 200907
#define met(a) memset(a,0,sizeof(a))
typedef long long LL;
//typedef __int64 LL;
using namespace std;
void read(int &x){
    #define CH getchar()
    char ch; x=0;for(ch=CH;ch<'0'||ch>'9';ch=CH);
    for(;ch>='0'&&ch<='9';x=x*10+ch-48,ch=CH);
}
char s[1000010];
int main()
{
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        int x;
        scanf("%s",s);
        scanf("%d",&x);
        int a[27];
        met(a);
        int len=strlen(s);
        int cnt=0;
        LL ans=0;
        int left=0;
        for(int i=0;i<len;i++)
        {
            if(!a[s[i]-'a'])
            {
                cnt++;
                a[s[i]-'a']++;
                if(cnt==x)
                {
                    ans=ans+len-i;
                    while(cnt==x)
                    {
                        a[s[left]-'a']--;
                        if(!a[s[left]-'a'])cnt--;
                        else
                            ans=ans+len-i;
                        left++;
                    }
                }
            }
            else{
                a[s[i]-'a']++;
            }
        }
        cout<<ans<<endl;
        //printf("%d\n",ans);
    }
    return 0;
}