#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)
{
// Valid frequency
}
else
{
u = 1;
break;
}
}
if (u == 0)
{
count = count + 1;
}
}
}
cout << count;
return 0;
}
CiNpbmNsdWRlIDxiaXRzL3N0ZGMrKy5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKQp7CiAgIHN0cmluZyBnOwogICBpbnQgbiwgazsKICAgY2luID4+IG4gPj4gayA+PiBnOwoKICAgaW50IGNvdW50ID0gMDsKCiAgIGZvciAoaW50IGkgPSAwOyBpIDw9IG4gLSAxOyBpKyspCiAgIHsKICAgICAgdW5vcmRlcmVkX21hcDxpbnQsIGludD4gYjsKCiAgICAgZm9yIChpbnQgaiA9IGk7IGogPD0gbiAtIDE7IGorKykKICAgICB7CiAgICAgICAgaW50IG51bWJlciA9IGdbal0gLSAnMCc7CiAgICAgICAgYltudW1iZXJdID0gYltudW1iZXJdICsgMTsKCiAgICAgICAgLy8gQ2hlY2sgd2hldGhlciBzdWJzdHJpbmcgaS4uLmogaXMgdmFsaWQKICAgICAgICBpbnQgdSA9IDA7CgogICAgICAgIGZvciAoaW50IGkgPSAwOyBpIDw9IDk7IGkrKykKICAgICAgICB7CiAgICAgICAgICAgIGlmIChiW2ldID09IGsgfHwgYltpXSA9PSAwKQogICAgICAgICAgICB7CiAgICAgICAgICAgICAgICAvLyBWYWxpZCBmcmVxdWVuY3kKICAgICAgICAgICAgfQogICAgICAgICAgICBlbHNlCiAgICAgICAgICAgIHsKICAgICAgICAgICAgICAgIHUgPSAxOwogICAgICAgICAgICAgICAgYnJlYWs7CiAgICAgICAgICAgIH0KICAgICAgICB9CgogICAgICAgIGlmICh1ID09IDApCiAgICAgICAgewogICAgICAgICAgICBjb3VudCA9IGNvdW50ICsgMTsKICAgICAgICB9CiAgICAgfQp9Cgpjb3V0IDw8IGNvdW50OwoKICAgIHJldHVybiAwOwp9Cg==