#include <bits/stdc++.h>
using namespace std;
int main()
{
string g;
int n, k;
cin >> n >> k >> g;
int count = 0;
for (int i = 0; i <= n - 1; i++)
{
unordered_map<int, int> b;
for (int j = i; j <= n - 1; j++)
{
int number = g[j] - '0';
b[number] = b[number] + 1;
// Check whether substring i...j is valid
int u = 0;
for (int i = 0; i <= 9; i++)
{
if (b[i] == k || b[i] == 0)// means single time you get frequency of character which is 'k' and '0' then fine
{
// Valid frequency
}
else // But if you not get then it is wrong means it is not valid substring
{
u = 1;
break;
}
}
if (u == 0)
{
count = count + 1;
}
}
}
cout << count;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpCnsKICAgc3RyaW5nIGc7CiAgIGludCBuLCBrOwogICBjaW4gPj4gbiA+PiBrID4+IGc7CgogICBpbnQgY291bnQgPSAwOwoKICAgZm9yIChpbnQgaSA9IDA7IGkgPD0gbiAtIDE7IGkrKykKICAgewogICAgICB1bm9yZGVyZWRfbWFwPGludCwgaW50PiBiOwoKICAgICBmb3IgKGludCBqID0gaTsgaiA8PSBuIC0gMTsgaisrKQogICAgIHsKICAgICAgICBpbnQgbnVtYmVyID0gZ1tqXSAtICcwJzsKICAgICAgICBiW251bWJlcl0gPSBiW251bWJlcl0gKyAxOwoKICAgICAgICAvLyBDaGVjayB3aGV0aGVyIHN1YnN0cmluZyBpLi4uaiBpcyB2YWxpZAogICAgICAgIGludCB1ID0gMDsKCiAgICAgICAgZm9yIChpbnQgaSA9IDA7IGkgPD0gOTsgaSsrKQogICAgICAgIHsKICAgICAgICAgICAgaWYgKGJbaV0gPT0gayB8fCBiW2ldID09IDApLy8gbWVhbnMgc2luZ2xlIHRpbWUgeW91IGdldCAgZnJlcXVlbmN5IG9mIGNoYXJhY3RlciB3aGljaCBpcyAnaycgYW5kICcwJyB0aGVuIGZpbmUgCiAgICAgICAgICAgIHsKICAgICAgICAgICAgICAgIC8vIFZhbGlkIGZyZXF1ZW5jeQogICAgICAgICAgICB9CiAgICAgICAgICAgIGVsc2UgLy8gQnV0IGlmIHlvdSBub3QgZ2V0IHRoZW4gaXQgaXMgd3JvbmcgbWVhbnMgaXQgaXMgbm90IHZhbGlkIHN1YnN0cmluZyAKICAgICAgICAgICAgewogICAgICAgICAgICAgICAgdSA9IDE7CiAgICAgICAgICAgICAgICBicmVhazsKICAgICAgICAgICAgfQogICAgICAgIH0KCiAgICAgICAgaWYgKHUgPT0gMCkKICAgICAgICB7CiAgICAgICAgICAgIGNvdW50ID0gY291bnQgKyAxOwogICAgICAgIH0KICAgICB9Cn0KCmNvdXQgPDwgY291bnQ7CgogICAgcmV0dXJuIDA7Cn0K