#include <iostream>
#include <fstream>
#include <set>

using namespace std;

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

const long long mod = 104659;
const int maxn = 1e3;
long long dp[maxn + 1][26];
bool rules[26][26];

int main() {
    int n, m;
    fin >> n >> m;
    for (int i = 0; i < m; i++) {
        char x, y;
        fin >> x >> y;
        rules[x - 'a'][y - 'a'] = rules[y - 'a'][x - 'a'] = true;
    }

    for (int i = 0; i < 26; i++)
        dp[1][i] = 1;
    for (int i = 2; i <= n; i++)
        for (int j = 0; j < 26; j++)
            for (int k = 0; k < 26; k++)
                if (!rules[j][k])
                    dp[i][j] = (dp[i][j] + dp[i - 1][k]) % mod;
    long long ans = 0;
    for (int i = 0; i < 26; i++)
        ans = (ans + dp[n][i]) % mod;
    fout << ans << '\n';

    return 0;
}