#include <bits/stdc++.h>
using namespace std;

const int ALPH = 26;
const int MOD = 104659;

int n, m;
bool forb[ALPH][ALPH];
int dp[1001][ALPH];

int main() {
    ifstream cin("nrcuv.in");
    ofstream cout("nrcuv.out");
    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        char x, y;
        cin >> x >> y;
        forb[x - 'a'][y - 'a'] = true;
        forb[y - 'a'][x - 'a'] = true;
    }
    for (int j = 0; j < ALPH; ++j) {
        dp[1][j] = 1;
    }
    for (int i = 2; i <= n; ++i) {
        for (int j = 0; j < ALPH; ++j) {
            for (int k = 0; k < ALPH; ++k) {
                if (!forb[j][k]) {
                    dp[i][j] = (dp[i][j] + dp[i - 1][k]) % MOD;
                }
            }
        }
    }
    int ans = 0;
    for (int j = 0; j < ALPH; ++j) {
        ans = (ans + dp[n][j]) % MOD;
    }
    cout << ans;
}