#include<bits/stdc++.h>
using namespace std;
template <typename T> bool maximize(T &res, const T &val){if(res < val) return res = val, true; return false;}
template <typename T> bool minimize(T &res, const T &val){if(res > val) return res = val, true; return false;}
#define ll long long
#define fi first
#define se second
#define pb push_back
#define FOR(i, a, b) for(int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for(int i = (b), _a = (a); i >= _a; i--)
#define REP(i, n) for(int i = 0, _n = (n); i < _n; i++)
#define C make_pair
#define MASK(i) (1LL << (i))
#define TURN_ON(i, x) ((x) | MASK(i))
#define TURN_OFF(i, x) ((x) & ~MASK(i))
#define RE(i, x) ((x) ^ MASK(i))
const ll mod = 1e9 + 7;
const ll INF = 1e15;
const int maxn = 1e5 + 5;
typedef pair<int, int> pi;
typedef pair<int, pair<int,int>> pii;
typedef pair<ll, ll> pl;
typedef pair<ll, pair<ll,ll>>pll;
struct edge{
int u,v,w;
edge(int u = 0, int v = 0, int w = 0)
{
this->u = u;
this->v = v;
this->w = w;
}
};
struct matrix{
ll val[3][3];
matrix(){
memset(val, 0, sizeof(val));
}
};
int n, k;
ll ans;
vector<int>a[310];
string s;
void nhap(){
cin >> n >> k;
FOR(i, 1, n){
cin >> s;
a[s.size()].pb(i);
}
}
void solve(){
FOR(i, 1, 30){
if(a[i].size() <= 1) continue;
REP(j, a[i].size()){
int v = a[i][j], cur = v + k;
int tmp = upper_bound(a[i].begin(), a[i].end(), cur) - a[i].begin();
tmp--;
if(j < tmp) ans += tmp - j;
}
}
cout << ans;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
nhap();
solve();
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp0ZW1wbGF0ZSA8dHlwZW5hbWUgVD4gYm9vbCBtYXhpbWl6ZShUICZyZXMsIGNvbnN0IFQgJnZhbCl7aWYocmVzIDwgdmFsKSByZXR1cm4gcmVzID0gdmFsLCB0cnVlOyByZXR1cm4gZmFsc2U7fQp0ZW1wbGF0ZSA8dHlwZW5hbWUgVD4gYm9vbCBtaW5pbWl6ZShUICZyZXMsIGNvbnN0IFQgJnZhbCl7aWYocmVzID4gdmFsKSByZXR1cm4gcmVzID0gdmFsLCB0cnVlOyByZXR1cm4gZmFsc2U7fQoKI2RlZmluZSBsbCBsb25nIGxvbmcKI2RlZmluZSBmaSBmaXJzdAojZGVmaW5lIHNlIHNlY29uZAojZGVmaW5lIHBiIHB1c2hfYmFjawojZGVmaW5lIEZPUihpLCBhLCBiKSBmb3IoaW50IGkgPSAoYSksIF9iID0gKGIpOyBpIDw9IF9iOyBpKyspCiNkZWZpbmUgRk9SRChpLCBiLCBhKSBmb3IoaW50IGkgPSAoYiksIF9hID0gKGEpOyBpID49IF9hOyBpLS0pCiNkZWZpbmUgUkVQKGksIG4pIGZvcihpbnQgaSA9IDAsIF9uID0gKG4pOyBpIDwgX247IGkrKykKI2RlZmluZSBDIG1ha2VfcGFpcgojZGVmaW5lIE1BU0soaSkgKDFMTCA8PCAoaSkpCiNkZWZpbmUgVFVSTl9PTihpLCB4KSAoKHgpIHwgTUFTSyhpKSkKI2RlZmluZSBUVVJOX09GRihpLCB4KSAoKHgpICYgfk1BU0soaSkpCiNkZWZpbmUgUkUoaSwgeCkgKCh4KSBeIE1BU0soaSkpCgpjb25zdCBsbCBtb2QgPSAxZTkgKyA3Owpjb25zdCBsbCBJTkYgPSAxZTE1Owpjb25zdCBpbnQgbWF4biA9IDFlNSArIDU7CnR5cGVkZWYgcGFpcjxpbnQsIGludD4gcGk7CnR5cGVkZWYgcGFpcjxpbnQsIHBhaXI8aW50LGludD4+IHBpaTsKdHlwZWRlZiBwYWlyPGxsLCBsbD4gcGw7CnR5cGVkZWYgcGFpcjxsbCwgcGFpcjxsbCxsbD4+cGxsOwoKc3RydWN0IGVkZ2V7CiAgICBpbnQgdSx2LHc7CiAgICBlZGdlKGludCB1ID0gMCwgaW50IHYgPSAwLCBpbnQgdyA9IDApCiAgICB7CiAgICAgICAgdGhpcy0+dSA9IHU7CiAgICAgICAgdGhpcy0+diA9IHY7CiAgICAgICAgdGhpcy0+dyA9IHc7CiAgICB9Cn07CnN0cnVjdCBtYXRyaXh7CiAgICBsbCB2YWxbM11bM107CiAgICBtYXRyaXgoKXsKICAgICAgICBtZW1zZXQodmFsLCAwLCBzaXplb2YodmFsKSk7CiAgICB9Cn07CgppbnQgbiwgazsKbGwgYW5zOwp2ZWN0b3I8aW50PmFbMzEwXTsKc3RyaW5nIHM7Cgp2b2lkIG5oYXAoKXsKCWNpbiA+PiBuID4+IGs7CglGT1IoaSwgMSwgbil7CgkJY2luID4+IHM7CgkJYVtzLnNpemUoKV0ucGIoaSk7Cgl9Cn0Kdm9pZCBzb2x2ZSgpewoJRk9SKGksIDEsIDMwKXsKCQlpZihhW2ldLnNpemUoKSA8PSAxKSBjb250aW51ZTsKCQlSRVAoaiwgYVtpXS5zaXplKCkpewoJCQlpbnQgdiA9IGFbaV1bal0sIGN1ciA9IHYgKyBrOwoJCQlpbnQgdG1wID0gdXBwZXJfYm91bmQoYVtpXS5iZWdpbigpLCBhW2ldLmVuZCgpLCBjdXIpIC0gYVtpXS5iZWdpbigpOwoJCQl0bXAtLTsKCQkJaWYoaiA8IHRtcCkgYW5zICs9IHRtcCAtIGo7CgkJfQoJfQoJY291dCA8PCBhbnM7Cn0KaW50IG1haW4oKXsKICAgIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oMCk7CiAgICBjaW4udGllKDApOyBjb3V0LnRpZSgwKTsKCW5oYXAoKTsKCXNvbHZlKCk7CiAgICByZXR1cm4gMDsKfQo=