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

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

int dp[2007][2007], a[2007][2007], n, m;

/**
dp[i][j] - nr de cuv de i litere care se termina cu j

dp[i][j] = sum(dp[i-1][k]), unde k = 0, 25, a[j][k] = a[k][j] = 0
*/

int main()
{
    int i, j, k;
    long long sol = 0;
    char x, y;
    fin >> n >> m;
    while(m--)
    {
        fin >> x >> y;
        a[x - 'a'][y - 'a'] = a[y - 'a'][x - 'a'] = 1;
    }
    for(i = 0; i <= 25; i++)
        dp[1][i] = 1;
    for(i = 2; i <= n; i++)
        for(j = 0; j <= 25; j++)
         for(k = 0; k <= 25; k++)
            if(a[j][k] == 0 && a[k][j] == 0) dp[i][j] = (dp[i][j] + dp[i - 1][k]) % 104659;
    for(i = 0; i <= 25; i++)
        sol = (sol + dp[n][i]) % 104659;
    fout << sol;
    return 0;
}