#include <bits/stdc++.h>
using namespace std;
int toii[500];
struct ac_node {
  int id, ch[4], fail;
} t[110];
int ac_node_cnt;
int dp[1010][110][15], len[15];
char s[15][15];
int pre[110];
inline int new_ac_node() {
  int x = ++ac_node_cnt;
  t[x].id = t[x].fail = 0;
  return memset(t[x].ch, 0, sizeof(t[x].ch)), x;
}
inline int insert_ac(int rt, char *s, int n, int id) {
  int x = rt;
  for (int i = 1; i <= n; i++) {
    int c = toii[(int)s[i]];
    if (!t[x].ch[c]) t[x].ch[c] = new_ac_node();
    x = t[x].ch[c];
  }
  t[x].id = id;
  return 0;
}
queue<int> q;
inline int get_fail(int rt) {
  while (!q.empty()) q.pop();
  for (int i = 0; i < 4; i++) {
    int &y = t[rt].ch[i];
    if (y)
      t[y].fail = rt, q.push(y), pre[y] = t[y].id;
    else
      y = rt;
  }
  while (!q.empty()) {
    int x = q.front();
    q.pop();
    for (int i = 0; i < 4; i++) {
      int &y = t[x].ch[i], f = t[x].fail, c = t[f].ch[i];
      if (y) {
        t[y].fail = c, q.push(y);
        if (t[y].id)
          pre[y] = t[y].id;
        else
          pre[y] = pre[c];
      } else
        y = c;
    }
  }
  return 0;
}
inline int get_dp(int n) {
  int m = ac_node_cnt, v;
  dp[0][1][0] = 1;
  for (int i = 0; i < n; i++)
    for (int x = 1; x <= m; x++)
      for (int j = 0; j < 10; j++)
        if ((v = dp[i][x][j]))
          for (int c = 0; c < 4; c++) {
            int y = t[x].ch[c];
            if (len[pre[y]] >= j + 1)
              (dp[i + 1][y][0] += v) %= 1000000009;
            else
              (dp[i + 1][y][j + 1] += v) %= 1000000009;
          }
  int ans = 0;
  for (int i = 1; i <= m; i++) (ans += dp[n][i][0]) %= 1000000009;
  return ans;
}
int main() {
  toii['A'] = 0, toii['T'] = 1, toii['C'] = 2, toii['G'] = 3;
  int n, m, rt;
  scanf("%d%d", &n, &m), rt = new_ac_node();
  for (int i = 1; i <= m; i++)
    scanf("%s", s[i] + 1), insert_ac(rt, s[i], len[i] = strlen(s[i] + 1), i);
  return get_fail(rt), !printf("%d\n", get_dp(n));
}
