// dp[i][j] = numarul de cuvinte de i litere cu ultima litera j

#include<cstdio>
using namespace std;
const int M = 104659;
int n,m,r[30][30],i,j,k,dp[1005][30],SOL;
char x,y;
int main()
{
    freopen("nrcuv.in","r",stdin);
    freopen("nrcuv.out","w",stdout);
    scanf("%d%d\n",&n,&m);
    for(;m;m--)
    {
        scanf("%c %c\n",&x,&y);
        r[x-'a'+1][y-'a'+1]=r[y-'a'+1][x-'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++)
            for(k=1;k<=26;k++)
                if(!r[k][j])
                    dp[i][j]=(dp[i][j]+dp[i-1][k])%M;
    for(i=1;i<=26;i++) SOL=(SOL+dp[n][i])%M;
    printf("%d\n",SOL);
    return 0;
}