#include <cstdio>
#include <iostream>
#define mod 104659

using namespace std;

int main() {
    freopen("nrcuv.in", "r", stdin);
    freopen("nrcuv.out", "w", stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    bool p[26][26];
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        char a, b;
        cin >> a >> b;
        p[a - 'a'][b - 'a'] = p[b - 'a'][a - 'a'] = true;
    }
    long long dp[1005][26];
    for (int j = 0; j < 26; j++) {
        dp[1][j] = 1;
    }
    for (int i = 2; i <= n; i++) {
        for (int j = 0; j < 26; j++) {
            for (int k = 0; k < 26; k++) {
                if (!p[j][k]) {
                    dp[i][j] = (dp[i][j] + dp[i - 1][k]) % mod;
                }
            }
        }
    }
    long long ans = 0;
    for (int j = 0; j < 26; j++) {
        ans = (ans + dp[n][j]) % mod;
    }
    cout << ans;

    return 0;
}