#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int n,m,i,j,p,q,k,a[1005][30],sol;
char ch1,ch2;
bool w[30][30];
int main()
{
    freopen("nrcuv.in","r",stdin);
    freopen("nrcuv.out","w",stdout);
    scanf("%d %d\n",&n,&m);
    for (i=1;i<=m;i++)
    {
        scanf("%c %c\n",&ch1,&ch2);
        w[ch1-'a'+1][ch2-'a'+1]=1;
        w[ch2-'a'+1][ch1-'a'+1]=1;
    }
    for (i=1;i<=26;i++)
    a[1][i]=1;
    if (n==1) {printf("%d",26); return 0;}
    for (i=2;i<=n;i++)
    for (j=1;j<=26;j++)
    {
        for (k=1;k<=26;k++)
        if (!w[j][k])
        a[i][j]=(a[i][j]+a[i-1][k])%104659;
        if (i==n)
        sol=(sol+a[i][j])%104659;
    }
    printf("%d",sol);
    return 0;
}