#include <bits/stdc++.h>
using namespace std;
inline int read() {
  static char ch;
  bool sgn = false;
  while (ch = getchar(), ch < '0' || ch > '9')
    if (ch == '-') sgn = true;
  int res = ch - 48;
  while (ch = getchar(), ch >= '0' && ch <= '9') res = res * 10 + ch - 48;
  return sgn ? -res : res;
}
const int N = 1001;
const int Mod = 1e9 + 9;
int n, m, sind, ans, dp[2][N][101];
char str[10][N];
queue<int> Q;
struct node {
  int nxt[4];
  int fail, dep;
  void init() {
    memset(nxt, -1, sizeof(nxt));
    fail = dep = 0;
  }
} s[N];
int getnum(char a) {
  if (a == 'A') return 0;
  if (a == 'G') return 1;
  if (a == 'C') return 2;
  if (a == 'T') return 3;
}
void ins(char *str) {
  int len = strlen(str);
  int i, j, ind;
  for (i = ind = 0; i < len; i++) {
    j = getnum(str[i]);
    if (s[ind].nxt[j] == -1) {
      sind++;
      s[sind].init();
      s[ind].nxt[j] = sind;
    }
    ind = s[ind].nxt[j];
  }
  s[ind].dep = len;
}
void make_fail() {
  int i, ind, ind_f;
  while (!Q.empty()) Q.pop();
  for (i = 0; i < 4; i++) {
    if (s[0].nxt[i] != -1) {
      Q.push(s[0].nxt[i]);
    }
  }
  while (!Q.empty()) {
    ind = Q.front();
    Q.pop();
    for (int i = 0; i < 4; i++) {
      if (s[ind].nxt[i] != -1) {
        Q.push(s[ind].nxt[i]);
        ind_f = s[ind].fail;
        while (ind_f > 0 && s[ind_f].nxt[i] == -1) ind_f = s[ind_f].fail;
        if (s[ind_f].nxt[i] != -1) ind_f = s[ind_f].nxt[i];
        s[s[ind].nxt[i]].fail = ind_f;
        s[s[ind].nxt[i]].dep = max(s[ind_f].dep, s[s[ind].nxt[i]].dep);
      }
    }
  }
}
int main() {
  n = read();
  m = read();
  sind = 0;
  s[sind].init();
  for (int i = 0; i < m; i++) {
    scanf("%s", str[i]);
    ins(str[i]);
  }
  make_fail();
  dp[0][0][0] = 1;
  for (int i = 0; i < n; i++) {
    memset(dp[(i + 1) & 1], 0, sizeof(dp[(i + 1) & 1]));
    for (int l = 0; l <= i; l++) {
      for (int j = 0; j <= sind; j++) {
        if (dp[i & 1][l][j] == 0) continue;
        for (int k = 0; k < 4; k++) {
          int now = j;
          while (s[now].nxt[k] == -1 && now) now = s[now].fail;
          if (s[now].nxt[k] != -1) {
            now = s[now].nxt[k];
            if (i + 1 - l > s[now].dep)
              (dp[(i + 1) & 1][l][now] += dp[i & 1][l][j]) %= Mod;
            else
              (dp[(i + 1) & 1][i + 1][now] += dp[i & 1][l][j]) %= Mod;
          }
        }
      }
    }
  }
  for (int i = 0; i <= sind; i++) (ans += dp[n & 1][n][i]) %= Mod;
  cout << ans;
}
