#include <bits/stdc++.h>
int trie[110][4], suf[110], tag[110], tn;
int q[110];
int f[1010][110][15];
int n, m;
inline int get(char c) {
  if (c == 'A') return 0;
  if (c == 'C') return 1;
  return c == 'G' ? 2 : 3;
}
int max(int x, int y) { return x > y ? x : y; }
int main() {
  scanf("%d %d", &n, &m);
  tn = 1;
  for (int i = 0; i < m; i++) {
    char s[15];
    scanf("%s", s);
    int j, k;
    for (j = k = 0; j < strlen(s); k = trie[k][get(s[j++])])
      if (!trie[k][get(s[j])]) {
        tag[tn] = 0;
        trie[k][get(s[j])] = tn++;
      }
    tag[k] = strlen(s);
  }
  int qn = 0;
  for (int i = 0; i < 4; i++)
    if (trie[0][i]) q[qn++] = trie[0][i];
  for (int p = 0; p < qn; p++) {
    tag[q[p]] = max(tag[q[p]], tag[suf[q[p]]]);
    for (int i = 0; i < 4; i++) {
      int next = trie[q[p]][i];
      if (next) {
        suf[next] = trie[suf[q[p]]][i];
        q[qn++] = next;
      } else
        trie[q[p]][i] = trie[suf[q[p]]][i];
    }
  }
  f[0][0][0] = 1;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < tn; j++)
      for (int k = 0; k < 12; k++)
        if (f[i][j][k]) {
          for (int c = 0; c < 4; c++) {
            int s = trie[j][c];
            if (k < tag[s]) {
              f[i + 1][s][0] += f[i][j][k];
              f[i + 1][s][0] %= 1000000009;
            } else {
              f[i + 1][s][k + 1] += f[i][j][k];
              f[i + 1][s][k + 1] %= 1000000009;
            }
          }
        }
  int ans = 0;
  for (int i = 0; i < tn; i++) ans = (ans + f[n][i][0]) % 1000000009;
  printf("%d\n", ans);
  return 0;
}
