#include <cstdio>
using namespace std;
const int N = 1001, ALFA = 27, PRIM = 104659;
bool incompatibil[ALFA][ALFA];
long long comb[N][ALFA];
int main()
{
    freopen("nrcuv.in","r", stdin);
    freopen("nrcuv.out", "w", stdout);
    int n, k, m, rez = 0, i, j;
    char a, b;
    scanf("%d %d\n", &n,&m);
    for(i = 1; i <= m; i++){
        scanf("%c %c\n", &a, &b);
        incompatibil[a-'a'+1][b-'a'+1] = true;
        incompatibil[b-'a'+1][a-'a'+1] = true;
    }
    for(j = 1; j < ALFA; j++){
        comb[1][j] = 1;
    }
    for(i = 2; i <= n; i++){
        for(j = 1; j < ALFA; j++){
            for(k = 1; k < ALFA; k++){
                if(incompatibil[k][j] == false || incompatibil[j][k] == false){
                    comb[i][j] =(comb[i][j]+comb[i-1][k])%PRIM;
                }
            }
        }
    }
    for(j = 1; j < ALFA; j++){
        rez += comb[n][j];
    }
    printf("%d", rez);
    return 0;
}