/*
    "TLE is like the wind, always by my side"
    - Yasuo - 2022 -
*/
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "

using namespace std;

bool comp[27][27];
int dp[1001][27];
const int mod=104659;

int main()
{
    ifstream fin("nrcuv.in");
    ofstream fout("nrcuv.out");
    long long n,m,i,j,sum,k;
    char a,b,s;
    fin >> n >> m;
    for (i=1; i<=m; i++)
    {
        fin >> a >> b;
        comp[a-'a'+1][b-'a'+1]=1;
        comp[b-'a'+1][a-'a'+1]=1;
    }
    for (i=1;i<=26;i++)
        dp[1][i]=1;
    for (i=2; i<=n; i++)
    {
        for (j=1; j<=26; j++)
        {
            sum=0;
            for (k=1; k<=26; k++)
            {
                if (!comp[j][k])
                {
                    sum+=dp[i-1][k];
                    if (sum>=mod)
                        sum-=mod;
                }
            }
            dp[i][j]=sum;
        }
    }
    sum=0;
    for (i=1;i<=26;i++)
    {
        sum+=dp[n][i];
        if (sum>=mod)
            sum-=mod;
    }
    fout << sum;
}