#include <cstdio>
#include <cstring>
#include <climits>
#include <queue>
#include <vector>
#include <algorithm>
const char BASE = 'A';
const int SIZE = 26;
const int MAX_N = 60;
const int MAX_M = 100;
const int MOD = 10007;
struct AC_Automaton {
    struct Node {
        int id;
        Node *c[SIZE], *fail, *next;
        bool isWord;
        Node(bool isWord = false) : c(), fail(NULL), next(NULL), isWord(isWord) {}
    } *root;
    void insert(const char *begin, const char *end) {
        Node **v = &root;
        for (const char *p = begin; p != end; p++) {
            if (!*v) *v = new Node(false);
            v = &(*v)->c[*p];
        }
        if (!*v) *v = new Node(true);
        else (*v)->isWord = true;
    }
    void build() {
        std::queue<Node *> q;
        root->fail = root, root->next = NULL;
        q.push(root);
        while (!q.empty()) {
            Node *v = q.front();
            q.pop();
            v->isWord |= v->fail->isWord;
            for (int i = 0; i < SIZE; i++) {
                Node *&c = v->c[i];
                if (!c) {
                    c = v == root ? root : v->fail->c[i];
                    continue;
                }
                Node *u = v->fail;
                c->fail = v != root && u->c[i] ? u->c[i] : root;
//				c->next = c->fail->isWord ? c->fail : c->fail->next;
                q.push(c);
            }
        }
    }
    void getNodeList(std::vector<Node *> &vec) {
        std::queue<Node *> q;
        q.push(root);
        while (!q.empty()) {
            Node *v = q.front();
            q.pop();
            vec.push_back(v);
            for (int i = 0; i < SIZE; i++) if (v->c[i]) q.push(v->c[i]);
        }
    }
} ac;
inline int pow(int a, int n) {
    int res = 1;
    for (; n; n >>= 1, a = (long long)a * a % MOD) if (n & 1) res = (long long)res * a % MOD;
    return res;
}
int f[MAX_M + 1][MAX_N * MAX_M + 100];
char s[MAX_M];
std::vector<AC_Automaton::Node *> nodes;
int main() {
    int n, m;
    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; i++) {
        scanf("%s", s);
        int len = strlen(s);
        for (int j = 0; j < len; j++) s[j] -= BASE;
        ac.insert(s, s + len);
    }
    ac.getNodeList(nodes);
#ifdef DBG
    printf("size of the node list : %d\n", nodes.size());
#endif
    ac.build();
    for (int i = 0; i < nodes.size(); i++) nodes[i]->id = i;
    memset(f, 0, sizeof(f));
    f[0][0] = 1;
    for (int i = 1; i <= m; i++) {
        for (int j = 0; j < nodes.size(); j++) {
            if (!nodes[j]->isWord && f[i - 1][j] > 0) {
                for (int k = 0; k < SIZE; k++) {
                    f[i][nodes[j]->c[k]->id] = (f[i][nodes[j]->c[k]->id] + f[i - 1][j]) % MOD;
                }
            }
        }
    }
    int ans = 0;
    for (int i = 0; i < nodes.size(); i++) {
        if (!nodes[i]->isWord) (ans += f[m][i]) %= MOD;
    }
    printf("%d", ((pow(26, m) - ans) % MOD + MOD) % MOD);
}