#include <bits/stdc++.h>
using namespace std;
const int N = 10 * 10 + 5;
const int CHAR_SET = 4;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 9;
long long dp[1005][N][12];
class trie_2 {
 private:
  vector<vector<int> > ch;
  vector<int> len, fail, q;
  int n, cnt, front, rear;
  int get_key(char c) const {
    if (c == 'A')
      return 0;
    else if (c == 'T')
      return 1;
    else if (c == 'C')
      return 2;
    else
      return 3;
  }

 public:
  explicit trie_2(int _n = N)
      : ch(_n, vector<int>(CHAR_SET)), len(_n), fail(_n), q(_n), n(1), cnt(1) {}
  void insert(const char* str, int l) {
    int u = 1;
    while (true) {
      if (*str == 0) {
        len[u] = l;
        break;
      }
      int v = get_key(*str);
      if (!ch[u][v]) ch[u][v] = ++cnt;
      u = ch[u][v];
      ++str;
    }
  }
  void build_trie_2() {
    front = 0;
    rear = 0;
    for (int i = 0; i < CHAR_SET; i++)
      if (ch[1][i]) {
        fail[ch[1][i]] = 1;
        q[rear++] = ch[1][i];
      } else
        ch[1][i] = 1;
    while (front != rear) {
      int u = q[front++];
      if (!len[u]) len[u] = len[fail[u]];
      for (int i = 0; i < CHAR_SET; i++)
        if (ch[u][i]) {
          fail[ch[u][i]] = ch[fail[u]][i];
          q[rear++] = ch[u][i];
        } else
          ch[u][i] = ch[fail[u]][i];
    }
  }
  long long solve(int n) {
    memset((dp), (0), sizeof(dp));
    dp[0][1][0] = 1;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= cnt; j++) {
        for (int k = 0; k <= 10; k++) {
          if (!dp[i - 1][j][k]) continue;
          for (int c = 0; c < CHAR_SET; c++) {
            int son = ch[j][c];
            if (len[son] >= k + 1)
              dp[i][son][0] = (dp[i][son][0] + dp[i - 1][j][k]) % MOD;
            else
              dp[i][son][k + 1] = (dp[i][son][k + 1] + dp[i - 1][j][k]) % MOD;
          }
        }
      }
    }
    long long ans = 0;
    for (int i = 1; i <= cnt; i++) ans = (ans + dp[n][i][0]) % MOD;
    return ans;
  }
} trie;
char s[15];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    scanf("%s", s);
    trie.insert(s, strlen(s));
  }
  trie.build_trie_2();
  printf("%lld\n", trie.solve(n));
  return 0;
}
