#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7, N = 1e3 + 7, A = 4, M = 1e9 + 9;
int idx(char c) {
  if (c == 'A')
    return 0;
  else if (c == 'C')
    return 1;
  else if (c == 'G')
    return 2;
  else
    return 3;
}
void add(int &a, int b) {
  a += b;
  if (a >= M) a -= M;
}
struct AC {
  int nxt[N][A], fail[N], yes[N], depth[N];
  int root, cnt;
  AC() {
    memset(nxt, 0, sizeof nxt);
    memset(fail, 0, sizeof fail);
    memset(yes, 0, sizeof yes);
    root = 0;
    cnt = 1;
    depth[root] = 0;
  }
  void insert(string s) {
    int u = root;
    for (char c : s) {
      int cc = idx(c);
      if (!nxt[u][cc]) nxt[u][cc] = cnt++;
      depth[nxt[u][cc]] = depth[u] + 1;
      u = nxt[u][cc];
    }
    yes[u] = 1;
  }
  void build_fail() {
    queue<int> q;
    for (int c = 0; c < A; c++) {
      if (nxt[0][c]) {
        fail[nxt[0][c]] = 0;
        q.push(nxt[0][c]);
      }
    }
    while (q.size()) {
      int u = q.front();
      q.pop();
      for (int c = 0; c < A; c++) {
        if (nxt[u][c]) {
          int v = nxt[u][c];
          q.push(v);
          int r = fail[u];
          while (r && !nxt[r][c]) r = fail[r];
          fail[v] = nxt[r][c];
        }
      }
    }
  }
  int dp[N][N][12];
  void solve(int n) {
    memset(dp, 0, sizeof dp);
    dp[0][0][0] = 1;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < cnt; j++) {
        for (int len = 0; len <= 10; len++) {
          if (!dp[i][j][len]) continue;
          for (int c = 0; c < A; c++) {
            int r = j;
            while (r && !nxt[r][c]) r = fail[r];
            if (!nxt[r][c]) continue;
            if (depth[r] < len) continue;
            r = nxt[r][c];
            int nwlen = len + 1;
            int rr = r;
            while (rr) {
              if (depth[rr] < len + 1) break;
              if (yes[rr]) {
                nwlen = 0;
                break;
              }
              rr = fail[rr];
            }
            add(dp[i + 1][r][nwlen], dp[i][j][len]);
          }
        }
      }
    }
    int ans = 0;
    for (int i = 0; i < cnt; i++) add(ans, dp[n][i][0]);
    cout << ans << endl;
  }
} ac;
signed main() {
  std::ios::sync_with_stdio(0);
  std::cin.tie(0);
  ;
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    string s;
    cin >> s;
    ac.insert(s);
  }
  ac.build_fail();
  ac.solve(n);
}
