#include <bits/stdc++.h>
#define MOD 104659
using namespace std;
///aproapeperm
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");

int N, M;
int a[30][30], dp[1005][30];

int main()
{
    char A, B;
    int i, j, k, x, y;
    fin >> N >> M;
    while (M--)
    {
        fin >> A >> B;
        x = A - 'a' + 1; y = B - 'a' + 1;
        a[x][y] = a[y][x] = 1;
    }
    for (i = 1; i <= 26; i++)
        dp[1][i] = 1;
    for (i = 2; i <= N; i++)
        for (j = 1; j <= 26; j++)
        {
            x = 0;
            for (k = 1; k <= 26; k++)
                if (a[j][k] == 0) x = (x + dp[i - 1][k]) % MOD;
            dp[i][j] = x;
        }
    x = 0;
    for (i = 1; i <= 26; i++)
        x = (x + dp[N][i]) % MOD;
    fout << x << "\n";
    return 0;
}