#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>

#define INF (1<<30)
#define mod 104659
#define i1 ((i+1)&1)
#define ii (i&1)

using namespace std;
int n, m, s, i, j, o, a[2][29], b[29][29];
char l[5];
int main()
{
    freopen("nrcuv.in", "r", stdin);
    freopen("nrcuv.out", "w", stdout);
    // O(n*m*m)
    scanf("%d%d\n", &n, &m);
    while(m--)
    {
        gets(l+1);
        i=l[1]-'a';
        j=l[3]-'a';
        b[i][j]=b[j][i]=1;
    }
    for(i=0;i<26;i++)
        a[1][i]=1;
    for(i=1;i<n;i++)
        for(j=0;j<26;j++)
            for(o=0;o<26;o++)
                if(!b[j][o])
                {
                    a[i1][o]+=a[ii][j];
                    if(a[i1][o]>=mod) a[i1][o]-=mod;
                }
    for(i=0;i<26;i++)
    {
        s+=a[n&1][i];
        if(s>=mod) s-=mod;
    }
    printf("%d", s);
    return 0;
}