#include <cstdio>
#define mod 104659
using namespace std;
int n, m, v[30][30], i, j, a[1010][30], X, Y, k, s;
char x, y;
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", &x, &y);
        X=x-'a'+1;
        Y=y-'a'+1;
        v[X][Y]=1;
        v[Y][X]=1;
    }
    for(j=1; j<27; j++)
        a[1][j]=1;
    for(i=2; i<=n; i++)
        for(j=1; j<27; j++)
            for(k=1; k<27; k++)
                if(v[j][k]==0)
                    a[i][j]=(a[i][j]+a[i-1][k])%mod;
    for(j=1; j<27; j++)
        s=(s+a[n][j])%mod;
    printf("%d\n", s);
    return 0;
}