#include <fstream>

using namespace std;

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

const int N = 1001;
const int x = 104659;

int n, m, sol, dp[N][26];
bool a[26][26];
int cmax = 'z' - 'a' + 1;

void solve()
{
    for(int j = 0; j < cmax; j++)
    {
        dp[1][j] = 1;
    }
    for(int i = 2; i <= n; i++)
    {
        for(int j = 0; j < cmax; j++)
        {
            for(int k = 0; k <cmax; k++)
            {
                if(!a[j][k])
                {
                    dp[i][j] = (dp[i][j] + dp[i - 1][k]) % x;
                }
            }
        }
    }
}

int main()
{
    fin>>n>>m;
    for(int i = 0; i < m; i++)
    {
        char c1, c2;
        fin>>c1>>c2;
        a[c1 - 'a'][c2 - 'a'] = a[c2 - 'a'][c1 - 'a'] = true;
    }
    solve();
    for(int i = 0; i <cmax; i++)
    {
        sol += dp[n][i];
        sol = sol % x;
    }
    fout<<sol;


    return 0;
}