#include <bits/stdc++.h>
using namespace std;
const int MAXN = 150;
const int MOD = 1000000009;
struct pp {
  int end, a[4], fail;
} node[MAXN];
int tot;
int q[MAXN];
void clr() {
  int i;
  tot++;
  for (i = 0; i < 4; i++) node[tot].a[i] = 0;
  node[tot].end = node[tot].fail = 0;
}
void ins(char s[]) {
  int temp, i;
  int h = 0;
  for (i = 0; s[i]; i++) {
    temp = s[i] - 1;
    if (node[h].a[temp] == 0) {
      clr();
      node[h].a[temp] = tot;
    }
    h = node[h].a[temp];
  }
  node[h].end = i;
}
void getfail() {
  int i;
  int f = -1, r = 0;
  int temp, p, son;
  q[0] = 0;
  while (f != r) {
    temp = q[++f];
    for (i = 0; i < 4; i++) {
      p = node[temp].fail;
      if (node[temp].a[i]) {
        son = node[temp].a[i];
        if (node[p].a[i] != son)
          node[son].fail = node[p].a[i];
        else
          node[son].fail = 0;
        q[++r] = son;
      } else
        node[temp].a[i] = node[p].a[i];
      node[temp].end = max(node[temp].end, node[p].end);
    }
  }
}
void change(char s[]) {
  int i;
  for (i = 0; s[i]; i++) {
    if (s[i] == 'A')
      s[i] = 1;
    else if (s[i] == 'C')
      s[i] = 2;
    else if (s[i] == 'G')
      s[i] = 3;
    else
      s[i] = 4;
  }
}
int dp[1005][MAXN][12];
int main() {
  int n, m, i, j, k, p;
  char str[15];
  scanf("%d%d", &n, &m);
  tot = -1;
  clr();
  for (i = 0; i < m; i++) {
    scanf("%s", str);
    change(str);
    ins(str);
  }
  getfail();
  dp[0][0][0] = 1;
  for (i = 0; i < n; i++)
    for (j = 0; j <= tot; j++)
      for (k = 0; k < 10; k++)
        for (p = 0; p < 4; p++) {
          int x = node[j].a[p];
          if (node[x].end > k) {
            dp[i + 1][x][0] += dp[i][j][k];
            dp[i + 1][x][0] %= MOD;
          } else {
            dp[i + 1][x][k + 1] += dp[i][j][k];
            dp[i + 1][x][k + 1] %= MOD;
          }
        }
  int ans = 0;
  for (i = 0; i <= tot; i++) ans = (ans + dp[n][i][0]) % MOD;
  printf("%d\n", ans);
  return 0;
}
