#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

const int MAXN = 1001;
const int MAXM = 2001;
const int LITERE = 26;
const int MOD = 104659;
const int CODE = 'a' - 1;
int n, m, ans = 0, d[MAXN][LITERE], a[MAXM][2];


void init()
{
    for(int i=1; i<=LITERE; i++)
        d[1][i] = 1;
}

int main()
{
    in>>n>>m;
    for(int i=1; i<=m; i++)
    {
        char c1, c2;
        in>>c1>>c2;
        c1 -= CODE;
        c2 -= CODE;
        a[c1][c2] = 1;
        a[c2][c1] = 1;
    }

    init();

    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=LITERE; j++)
        {
            for(int k = 1; k<=LITERE; k++)
            {
                if(a[k][j] == 0 || a[j][k] == 0)
                {
                    d[i][j] += d[i-1][k];
                    d[i][j] %= MOD;
                }
            }
        }
    }

    for(int i=1; i<=LITERE; i++)
    {
        ans += d[n][i];
        ans %= MOD;
    }
    out<<ans;
    return 0;
}