#include <stdio.h>
#define MAXN 1000
#define MOD 104659
int ok['z'-'a'+1]['z'-'a'+1], d[MAXN]['z'-'a'+1];
int main(){
    int n, m, i, j, k, sum;
    char a, b;
    FILE *fin, *fout;
    fin=fopen("nrcuv.in", "r");
    fout=fopen("nrcuv.out", "w");
    fscanf(fin, "%d%d ", &n, &m);
    for(i=0; i<m; i++){
        a=fgetc(fin);
        fgetc(fin);
        b=fgetc(fin);
        fgetc(fin);
        ok[a-'a'][b-'a']=1;
        ok[b-'a'][a-'a']=1;
    }
    for(j=0; j<='z'-'a'; j++){
        d[0][j]=1;
    }
    for(i=1; i<n; i++){
        for(j=0; j<='z'-'a'; j++){
            for(k=0; k<='z'-'a'; k++){
                if(ok[k][j]==0){
                    d[i][j]+=d[i-1][k];
                    if(d[i][j]>=MOD){
                        d[i][j]-=MOD;
                    }
                }
            }
        }
    }
    sum=0;
    for(j=0; j<='z'-'a'+1; j++){
        sum+=d[n-1][j];
        if(sum>=MOD){
            sum-=MOD;
        }
    }
    fprintf(fout, "%d\n", sum);
    fclose(fin);
    fclose(fout);
    return 0;
}