#include <bits/stdc++.h>
using namespace std;
const int N = 150;
const int Mod = 1e9 + 9;
int n, m, ans, tot, q[N], val[N], fail[N], c[N][4], f[2][N][12];
char s[20];
template <class T>
inline void in(T &x) {
  x = 0;
  int f = 0;
  char ch = getchar();
  for (; ch < '0' || ch > '9';) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  for (; ch >= '0' && ch <= '9';) x = x * 10 + ch - '0', ch = getchar();
  x = f ? -x : x;
}
inline int trs(char ch) {
  return ch == 'A' ? 0 : (ch == 'C' ? 1 : (ch == 'G') ? 2 : 3);
}
inline void ins() {
  int x = 1, ls = strlen(s + 1);
  for (int w, i = 1; i <= ls; ++i) {
    w = trs(s[i]);
    if (!c[x][w]) c[x][w] = ++tot;
    x = c[x][w];
  }
  val[x] = ls;
}
inline void build() {
  int x, u, v, l = 0, r = 0;
  for (int i = 0; i < 4; ++i)
    if (c[1][i])
      q[++r] = c[1][i], fail[c[1][i]] = 1;
    else
      c[1][i] = 1;
  for (; l < r;) {
    u = q[++l], val[u] = max(val[u], val[fail[u]]);
    for (int i = 0; i < 4; ++i)
      if ((v = c[u][i]))
        fail[v] = c[fail[u]][i], q[++r] = v;
      else
        c[u][i] = c[fail[u]][i];
  }
}
inline void solve() {
  f[0][1][0] = 1;
  int v, now = 0, lst = 1;
  for (int t = 1; t <= n; ++t) {
    now ^= 1, lst ^= 1;
    memset(f[now], 0, sizeof f[now]);
    for (int j = 1; j <= tot; ++j)
      for (int k = 0; k <= 10; ++k)
        if (f[lst][j][k])
          for (int i = 0; i < 4; ++i)
            if ((v = c[j][i])) {
              if (val[v] > k)
                (f[now][v][0] += f[lst][j][k]) %= Mod;
              else
                (f[now][v][k + 1] += f[lst][j][k]) %= Mod;
            }
  }
  for (int i = 1; i <= tot; ++i) ans = (ans + f[now][i][0]) % Mod;
  printf("%d\n", ans);
}
int main() {
  in(n), in(m), tot = 1;
  for (int i = 1; i <= m; ++i) scanf("%s", s + 1), ins();
  build(), solve();
  return 0;
}
