#include <fstream>
#include <iostream>
using namespace std;

int n, m;
int a[26][26];

void read() {
    int i;
    char x, y;
    ifstream f("nrcuv.in");
    f >> n >> m;
    for (i = 1; i <= m; i++) {
        f >> x >> y;
        a[x - 'a'][y - 'a'] = a[y - 'a'][x - 'a'] = 1;
    }
    f.close();
}

const int MOD = 104659;
int dp[1001][26];
int rez;

void solve() {
    int i, j, k;
    for (i = 0; i < 26; i++)
        dp[1][i] = 1;
    for (i = 2; i <= n; i++)
        for (j = 0; j < 26; j++)
            for (k = 0; k < 26; k++)
                if (a[j][k] == 0)
                    dp[i][j] = (dp[i][j] + dp[i - 1][k]) % MOD;
    for (i = 0; i < 26; i++)
        rez = (rez + dp[n][i]) % MOD;
}

void output() {
    ofstream g("nrcuv.out");
    g << rez;
    g.close();
}

int main() {
    read();
    solve();
    output();
    return 0;
}