#include <fstream>
#define MOD 104659

using namespace std;
char c1, c2;
int a[26][26];
int d[1001][26];
int n, m, i, j, k, sol;
int main () {
    ifstream fin ("nrcuv.in");
    ofstream fout("nrcuv.out");

    fin>>n>>m;
    for (i=1;i<=m;i++) {
        fin>>c1>>c2;
        a[c1-'a'][c2-'a'] = 1;
        a[c2-'a'][c1-'a'] = 1;
    }
    for (j=0; j<26;j++) {
        d[1][j] = 1;
    }

    for (i=2; i<=n; i++) {
        /// calculez linia i din matricea d, adica numar cuvinte de lungime i
        /// din cuvinte de lungime i-1 adica adaugand o litera
        for (j=0;j<26;j++) {
            /// calculez d[i][j] = cate siruri de lungime i se termina cu a j-a litera
            d[i][j] = 0;
            for (k=0; k<26; k++)
                if (a[k][j] == 0) {
                    d[i][j] += d[i-1][k];
                    d[i][j] %= MOD;
                }
        }
    }
    sol = 0;
    for (i=0; i<26; i++){
        sol += d[n][i];
        sol %= MOD;
    }
    fout<<sol;

    return 0;
}