#include <fstream>
#include <cstring>
#include <algorithm>
using namespace std;

ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");

const int MAXN = 1005;
const int MAXL = 26;
const int REST = 104659;
int n, m;
int v[3][30];
bool q[30][30];

int conv(char k) {
    return k - 'a' + 1;
}

int main() {
    fin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        char a, b;
        fin >> a >> b;
        q[conv(a)][conv(b)] = 1;
        q[conv(b)][conv(a)] = 1;
    }
    for (int i = 1; i <= MAXL; ++i) {
        v[1][i] = 1;
    }
    for (int i = 2; i <= n; ++i) {
        for (int j = 1; j <= MAXL; ++j) {
            for (int k = 1; k <= MAXL; ++k) {
                if (q[j][k] == 0) {
                    v[2][j] += v[1][k];
                    v[2][j] %= REST;
                }
            }
        }
        for (int i = 1; i <= MAXL; ++i) {
            v[1][i] = v[2][i];
            v[2][i] = 0;
        }
    }
    int sol = 0;
    for (int i = 1; i <= MAXL; ++i) {
        sol += v[1][i];
        sol %= REST;
    }
    fout << sol;
    fout.close();
    return 0;
}