#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
constexpr int MOD = 1610612741;
constexpr int mod = 1e9 + 7;
constexpr int base = 131;
int power(int a, int n)
{
    int ret = 1;
    while (n)
    {
        if (n & 1)
            ret = (ll)ret * a % MOD;
        a = (ll)a * a % MOD;
        n >>= 1;
    }
    return ret;
}
int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m, k, cnt = 0;
    cin >> n >> m >> k;
    vector<map<int, int>> mps(n + 1);
    int p = power(base, k - 1);
    for (int j = 1; j <= n; j++)
    {
        string s;
        cin >> s;
        if (s.size() < k)
            continue;
        int f = 0;
        for (int i = 0; i < k; i++)
            f = ((ll)f * base + s[i]) % MOD;
        mps[j][f]++;
        for (int i = k; i < s.size(); i++)
            f = (f - (ll)p * s[i - k] % MOD + MOD) % MOD, f = ((ll)f * base + s[i]) % MOD, mps[j][f]++;
    }
    vector<int> ans(m + 1);
    auto dfs = [n, m, &ans, &cnt, &mps](auto &&self, int cur_id, int cur_num) -> void
    {
        if (cur_id == m + 1)
        {
            for (const auto &[val, amount] : mps[ans[1]])
            {
                int temp = amount;
                for (int i = 2; i <= m; i++)
                    temp = (ll)temp * mps[ans[i]][val] % mod;
                cnt = (cnt + temp) % mod;
            }
        }
        else if (n - cur_num >= m - cur_id)
        {
            self(self, cur_id, cur_num + 1);
            ans[cur_id] = cur_num;
            self(self, cur_id + 1, cur_num + 1);
        }
    };
    dfs(dfs, 1, 1);
    cout << cnt << '\n';
    return 0;
}