1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdlib>
 4 #include<cstdio>
 5 #include<algorithm>
 6 #include<cmath>
 7 #include<queue>
 8 #include<map>
 9 #include<string>
10 
11 #define N 100005
12 #define M 15
13 #define mod 10000007
14 //#define p 10000007
15 #define mod2 100000000
16 #define ll long long
17 #define LL long long
18 #define maxi(a,b) (a)>(b)? (a) : (b)
19 #define mini(a,b) (a)<(b)? (a) : (b)
20 
21 using namespace std;
22 
23 int T;
24 int n;
25 ll l;
26 char s[N];
27 ll ans;
28 ll vis[30];
29 ll k;
30 ll te;
31 
32 void ini()
33 {
34     ans=0;
35     scanf("%s",s);
36     scanf("%I64d",&k);
37     l=strlen(s);
38     memset(vis,0,sizeof(vis));
39 }
40 
41 
42 void solve()
43 {
44     ll i;
45     ll pre;
46     pre=0;
47     for(i=0;i<l;i++){
48         vis[ s[i]-‘a‘ ]++;
49         while(vis[ s[i]-‘a‘ ]>k){
50             vis[ s[pre]-‘a‘ ]--;
51             pre++;
52         }
53         ans+=i-pre+1;
54     }
55 }
56 
57 void out()
58 {
59     printf("%I64d\n",ans);
60 }
61 
62 int main()
63 {
64     //freopen("data.in","r",stdin);
65     //freopen("data.out","w",stdout);
66     scanf("%d",&T);
67    // for(int ccnt=1;ccnt<=T;ccnt++)
68     while(T--)
69    // while(scanf("%d",&n)!=EOF)
70     {
71       //  if(n==0 && m==0) break;
72         //printf("Case %d: ",ccnt);
73         ini();
74         solve();
75         out();
76     }
77 
78     return 0;
79 }