#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
const long long mod = 1e9 + 9;
struct node {
  int son[5];
  int fail, tag;
};
node t1[maxn];
int top;
inline int newn() {
  top++;
  return top;
}
inline int sth(char c) {
  if (c == 'A') return 0;
  if (c == 'T') return 1;
  if (c == 'C') return 2;
  if (c == 'G') return 3;
}
inline void insert(string s) {
  int u = 0;
  for (int i = 0; i < s.size(); i++) {
    int tp = sth(s[i]);
    if (t1[u].son[tp] == 0) t1[u].son[tp] = newn();
    u = t1[u].son[tp];
  }
  t1[u].tag = s.size();
}
inline void build() {
  queue<int> q;
  for (int i = 0; i < 4; i++) {
    if (t1[0].son[i]) {
      q.push(t1[0].son[i]);
    }
  }
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int i = 0; i < 4; i++) {
      int v = t1[u].son[i];
      if (v == 0) {
        t1[u].son[i] = t1[t1[u].fail].son[i];
        continue;
      }
      t1[v].fail = t1[t1[u].fail].son[i];
      t1[v].tag = max(t1[v].tag, t1[t1[v].fail].tag);
      q.push(v);
    }
  }
}
int dp[maxn][105][15], n, m;
int main() {
  cin >> n >> m;
  int maxs = 0;
  for (int i = 1; i <= m; i++) {
    string s;
    cin >> s;
    insert(s);
    maxs = max(maxs, (int)s.size());
  }
  build();
  dp[0][0][0] = 1;
  for (int i = 0; i <= n - 1; i++) {
    for (int j = 0; j <= top; j++) {
      for (int k = 0; k <= maxs; k++) {
        for (int l = 0; l < 4; l++) {
          int j1 = t1[j].son[l];
          if (k + 1 <= t1[j1].tag) {
            dp[i + 1][j1][0] = (dp[i + 1][j1][0] + dp[i][j][k]) % mod;
            continue;
          }
          if (k + 1 <= maxs) {
            dp[i + 1][j1][k + 1] = (dp[i + 1][j1][k + 1] + dp[i][j][k]) % mod;
            continue;
          }
        }
      }
    }
  }
  int ans = 0;
  for (int i = 0; i <= top; i++) {
    ans = (ans + dp[n][i][0]) % mod;
  }
  cout << ans << endl;
}
