#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define Mod 104659
#define Dim 1005

using namespace std;
int n, A, B, m, dp[Dim][30], Sol;
char a, b;
bool x[30];
vector <int> v[Dim], l[Dim];
void read()
{
    freopen("nrcuv.in ", "r", stdin);
    freopen("nrcuv.out", "w", stdout);
    scanf("%d%d\n", &n, &m);
    for(int i = 0; i < m; ++ i)
    {
        scanf("%c %c\n", &a, &b);
        A = a - 'a';
        B = b - 'a';
        l[A].push_back(B);
        l[B].push_back(A);
    }
}
void solve()
{
    int i, j, k;
    for(i = 0; i < 26; ++ i)
    {
        memset(x, 0, sizeof(x));
        for(j = 0; j < l[i].size(); ++ j)
            x[l[i][j]] = 1;
        for(j = 0; j < 26; ++ j)
            if(!x[j])
                v[i].push_back(j);
    }
    for(i = 0; i < 26; ++ i)
        dp[0][i] = 1;
    for(i = 1; i < n; ++ i)
        for(j = 0; j < 27; ++ j)
            for(k = 0; k < v[j].size(); ++ k)
                dp[i][j] = (dp[i][j] + dp[i - 1][v[j][k]]) % Mod;

    for(i = 0; i < 26; ++ i)
        Sol = (Sol + dp[n - 1][i]) % Mod;

}
void write()
{
    printf("%d\n", Sol);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}