#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000009;
int n, m, tail = 1;
int nxt[110][4], fail[110], ed[110], d[110], q[110];
int f[1100][110][15];
char st[15];
int ckmax(int &a, int b) { return a < b ? (a = b), 1 : 0; }
void insert() {
  int i, j;
  for (i = 0, j = 0; st[i]; i++) {
    int c = (st[i] == 'A' ? 0 : st[i] == 'C' ? 1 : st[i] == 'G' ? 2 : 3);
    if (!nxt[j][c]) d[nxt[j][c] = tail++] = d[j] + 1;
    j = nxt[j][c];
  }
  ed[j] = d[j];
}
void build() {
  int l, r, p;
  for (fail[q[l = r = 0] = 0] = 0; l <= r; l++) {
    p = q[l];
    for (int i = 0; i < 4; i++)
      !nxt[p][i]
          ? nxt[p][i] = nxt[fail[p]][i]
          : ckmax(ed[nxt[p][i]],
                  ed[fail[q[++r] = nxt[p][i]] = (p ? nxt[fail[p]][i] : 0)]);
  }
}
int F(int i, int j, int k) {
  if (~f[i][j][k]) return f[i][j][k];
  if (!i) return f[i][j][k] = ed[j] >= k;
  f[i][j][k] = 0;
  for (int a = 0; a < 4; a++)
    if (nxt[j][a]) {
      int kk = ed[j] >= k ? 1 : k + 1;
      if (d[nxt[j][a]] < kk) continue;
      (f[i][j][k] += F(i - 1, nxt[j][a], kk)) %= MOD;
    }
  return f[i][j][k];
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) scanf("%s", st), insert();
  build();
  memset(f, 0xff, sizeof(f));
  printf("%d\n", F(n, 0, 0));
  return 0;
}
