#include <iostream>
#include <fstream>
using namespace std;
ifstream in("nrcuv.in");
ofstream out("nrcuv.out");
int dp[1005][30];
bool M[30][30];
int main()
{
    int n, m;
    in >> n >> m;
    for(int i = 1; i <= m; i ++)
    {
        char a, b;
        in >> a >> b;
        int a1 = a - 'a' + 1;
        int b1 = b - 'a' + 1;
        M[a1][b1] = 1;
        M[b1][a1] = 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 ++)
        {
            int s = 0;
            for(int k = 1; k <= 26; k ++)
            {
                if(M[j][k] == 0)
                    s += dp[i - 1][k];
            }
            dp[i][j] += s;
        }
    }
    long long s = 0;
    for(int i = 1; i <= 26; i ++)
        s += dp[n][i];
    out << s % 104659<< " ";
    return 0;
}