#include <cstdio>
#include <bitset>
#include <iostream>
using namespace std;
const int mod = 104659;
const int maxn = 1005;
const int sigma = 26;
bitset <30> M[30];
int dp[maxn][30];

int main()
{
    freopen("nrcuv.in", "r", stdin);
    freopen("nrcuv.out", "w", stdout);
    int n, m;
    char p;
    scanf("%d%d", &n, &m);
    scanf("%c", &p);
    for(int i = 1; i <= m; i++)
    {
        char x1, y1;
        scanf("%c%c", &x1, &y1);
        scanf("%c\n", &y1);
        int x = x1 - 'a' + 1;
        int y = y1 - 'a' + 1;
        M[x][y] = 1;
        M[y][x] = 1;
    }
    for(int k = 1; k <= sigma; k++)
        dp[1][k] = 1;
    for(int i = 2; i <= n; i++)
    {
        for(int j = 1; j <= sigma; j++)
        {
            int s = 0;
            for(int k = 1; k <= sigma; k++)
                if(M[j][k] == 0)
                    s += dp[i-1][k];
            dp[i][j] = s % mod;
        }
    }
    int s = 0;
    for(int i = 1; i <= sigma; i++)
        s += dp[n][i];
    printf("%d\n", s % mod);
    return 0;
}