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

const int MOD = 104659;
int a[27][27], dp[1005][27];

int main()
{
    ifstream cin("nrcuv.in");
    ofstream cout("nrcuv.out");
    int n, q;
    cin >> n >> q;

    for (int i = 1; i <= q; ++i)
    {
        char x, y;
        cin >> x >> y;
        a[x-'a'+1][y-'a'+1] = a[y-'a'+1][x-'a'+1] = 1;
    }

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

    for (int i = 2; i <= n; ++i)
        for (int j = 1; j <= 26; ++j)
            for (int k = 1; k <= 26; ++k)
                if (!a[j][k])
                    dp[i][j] = (dp[i][j] + dp[i-1][k]) % MOD;

    int ans = 0;
    for (int i = 1; i <= 26; ++i)
        ans = (ans + dp[n][i]) % MOD;

    cout << ans;

    return 0;
}