#include <cstdio>
#define MOD 104659
using namespace std;

int n, m, i, j, k, S, not_ok[31][31], dp[1002][31];
char c1, c2;

int main()
{
    freopen("nrcuv.in", "r", stdin);
    freopen("nrcuv.out", "w", stdout);
    scanf("%d%d", &n, &m);
    while( m-- )
    {
        scanf(" %c %c ", &c1, &c2);
        not_ok[c1 - 'a' + 1][c2 - 'a' + 1] = 1;
        not_ok[c2 - 'a' + 1][c1 - 'a' + 1] = 1;
    }

    for(i=1; i<=26; ++i)
        dp[1][i] = 1; // se poate forma cate 1 cuvant de lungime 1 cu litera i

    for(i=2; i<=n; ++i)
        for(j=1; j<=26; ++j)
            for(k=1; k<=26; ++k)
                if( !not_ok[j][k] )
                {

                    dp[i][k] += dp[i-1][j]; // se pune litera k dupa litera j
                    dp[i][k] %= MOD;

                }

    for(i=1; i<=26; ++i)
    {
        S += dp[n][i];
        S %= MOD;
    }
    printf("%d\n", S);
    return 0;
}