#include <bits/stdc++.h>
#define MOD 104659
#define ll long long

using namespace std;

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

ll n, k, dp[1005][30];
bool alaturate[30][30];

int main()
{
    f >> n >> k;
    for(int i = 1; i <= k; i++)
    {
        char x, y;
        f >> x >> y;
        alaturate[x - 'a'][y - 'a'] = alaturate[y - 'a'][x - 'a'] = 1;
    }
    for(int i = 0; i < 26; i++)
        dp[1][i] = 1;
    for(int i = 1; i <= n; i++)
        for(int j = 0; j < 26; j++)
            for(int k = 0; k < 26; k++)
                if(!alaturate[j][k])
                    dp[i][j] = (dp[i][j] + dp[i - 1][k]) % MOD;
    ll sol = 0;
    for(int i = 0; i < 26; i++)
        sol = (sol + dp[n][i]) % MOD;
    g << sol;
    return 0;
}