#include<fstream>
#include<iostream>
#include<algorithm>
#include<unordered_map>
#define DN 1005
#define M 104659
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
int n,m,a[35][35],dp[35][DN],rez;
char f,g;
int main()
{
    fin>>n>>m;
    while(m--)
    {
        fin>>f>>g;
        a[f-'a'+1][g-'a'+1]=a[g-'a'+1][f-'a'+1]=1;
    }
    for(int i=1;i<=26;i++)
        dp[i][1]=1;
    for(int i=2;i<=n;i++)
        for(int j=1;j<=26;j++)
            for(int h=1;h<=26;h++)
                if(!a[j][h])
                    dp[j][i]=(dp[j][i]+dp[h][i-1])%M;
    for(int i=1;i<=26;i++)
        rez=(rez+dp[i][n])%M;
    fout<<rez;
}