#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000009;
struct node {
  int chi[4], fail, dep, edDep;
  node() {
    memset(chi, 0, sizeof(chi));
    dep = fail = edDep = 0;
  }
} a[105];
int V;
namespace acAuto {
void init() { V = 1; }
void ins(int* s, int n) {
  int u = 1;
  for (int i = 1; i <= n; i++) {
    if (!a[u].chi[s[i]]) {
      a[u].chi[s[i]] = ++V;
      a[V].dep = i;
    }
    u = a[u].chi[s[i]];
  }
  a[u].edDep = n;
}
void build() {
  queue<int> que;
  que.push(1);
  while (!que.empty()) {
    int u = que.front();
    que.pop();
    for (int i = 0; i < 4; i++) {
      int v = a[u].chi[i], f = a[u].fail;
      if (v) {
        if (f)
          a[v].fail = a[f].chi[i];
        else
          a[v].fail = 1;
        a[v].edDep = max(a[v].edDep, a[a[v].fail].edDep);
        que.push(v);
      } else {
        if (f)
          a[u].chi[i] = a[f].chi[i];
        else
          a[u].chi[i] = 1;
      }
    }
  }
}
}  // namespace acAuto
int idx[135], n, m, f[1005][105][15], sidx[15];
char s[15];
int main() {
  idx['A'] = 0, idx['C'] = 1, idx['G'] = 2, idx['T'] = 3;
  acAuto::init();
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    scanf("%s", s + 1);
    int l = strlen(s + 1);
    for (int j = 1; j <= l; j++) sidx[j] = idx[(int)s[j]];
    acAuto::ins(sidx, l);
  }
  acAuto::build();
  f[0][1][0] = 1;
  for (int i = 0; i < n; i++) {
    for (int u = 1; u <= V; u++) {
      for (int j = 0; j <= a[u].dep; j++) {
        for (int k = 0; k < 4; k++) {
          int v = a[u].chi[k];
          if (a[v].dep >= j + 1) {
            (f[i + 1][v][a[v].edDep >= j + 1 ? 0 : j + 1] += f[i][u][j]) %= mod;
          }
        }
      }
    }
  }
  int ans = 0;
  for (int u = 1; u <= V; u++) (ans += f[n][u][0]) %= mod;
  printf("%d\n", ans);
  return 0;
}
