#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000009;
const char *p = "ACGT";
int TO[110][4];
int cut[110][4];
map<string, int> SET;
int n, m, cnt, ans;
string s[10];
int dp[1005][110][11];
void init() {
  cnt = 0;
  for (int i = 0; i < m; i++) {
    for (int j = 0; j <= s[i].size(); j++) {
      string t = s[i].substr(0, j);
      if (SET.find(t) == SET.end()) SET[t] = cnt++;
    }
  }
  for (map<string, int>::iterator it = SET.begin(); it != SET.end(); it++) {
    string ss = it->first;
    int id = it->second;
    for (int i = 0; i < 4; i++) {
      string t = ss + p[i];
      bool ok = false;
      for (int j = 0; j < t.length(); j++) {
        string h = t.substr(j, t.length() - j);
        if (SET.find(h) != SET.end()) {
          ok = true;
          TO[id][i] = SET[h];
          break;
        }
      }
      if (!ok) TO[id][i] = SET[""];
      cut[id][i] = 0;
      for (int j = 0; j < t.length(); j++) {
        string h = t.substr(j, t.length() - j);
        bool ok = false;
        for (int k = 0; k < m; k++)
          if (h == s[k]) {
            cut[id][i] = t.length() - j;
            ok = true;
          }
        if (ok) break;
      }
    }
  }
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < m; i++) cin >> s[i];
  init();
  dp[0][0][0] = 1;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < cnt; j++)
      for (int reach = 0; reach <= 10; reach++) {
        if (dp[i][j][reach] == 0) continue;
        for (int k = 0; k < 4; k++) {
          int newreach = cut[j][k] >= reach + 1 ? 0 : reach + 1;
          if (newreach > 10) continue;
          dp[i + 1][TO[j][k]][newreach] += dp[i][j][reach];
          dp[i + 1][TO[j][k]][newreach] %= mod;
        }
      }
  int ans = 0;
  for (int i = 0; i < cnt; i++) {
    ans += dp[n][i][0];
    ans %= mod;
  }
  printf("%d\n", ans);
  return 0;
}
