#include <iostream>
#include <fstream>

using namespace std;

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

const int MOD = 104659;

int  n, m;
int  dp[1000][26];
bool r[26][26];

int main() {
    in >> n >> m;

    char a, b;
    for (int i = 0; i < m; i++) {
        in >> a >> b;
        r[a - 'a'][b - 'a'] = 1;
    }

    for (int i = 0; i < 26; i++) {
        dp[0][i] = 1;
    }

    for (int i = 1; i < n; i++) {
        for (int j = 0; j < 26; j++) {
            for (int k = 0; k < 26; k++) {
                if (!r[k][j] && !r[j][k]) {
                    dp[i][j] += dp[i - 1][j];
                }
                dp[i][j] %= MOD;
            }
        }
    }

    int sum = 0;
    for (int i = 0; i < 26; i++) {
        sum += dp[n - 1][i];
        sum %= MOD;
    }

    out << sum;

    return 0;
}