#include <bits/stdc++.h>

std::ifstream fin("nrcuv.in");
std::ofstream fout("nrcuv.out");

const int SIZE = 1005;
const int SIGMA = 'z' + 1;
const int mod = 104659;

int n, m;
bool invalid[SIGMA][SIGMA];
std::vector<char> ok[SIGMA];

// dp[i][j] - nr de cuv de lg i care se termina cu j
int dp[SIZE][SIGMA];

inline int64_t max(int64_t a, int64_t b) {return ((a > b) ? a : b);}

int main() 
{
    fin >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        char a, b;
        fin >> a >> b;
        invalid[a][b] = invalid[b][a] = true;
    }

    for(int i = 'a'; i <= 'z'; ++i)
        for(char j = 'a'; j <= 'z'; ++j)
            if(!invalid[i][j])
                ok[i].emplace_back(j);

    for(int i = 'a'; i <= 'z'; ++i)
        dp[1][i] = 1;

    for(int i = 2; i <= n; ++i)
        for(int j = 'a'; j <= 'z'; ++j)
            for(auto k : ok[j])
                dp[i][j] = (dp[i][j] + dp[i - 1][k]) % mod;

    int ans = 0;
    for(int i = 'a'; i <= 'z'; ++i)
        ans = (ans + dp[n][i]) % mod;

    fout << ans;

    return 0;
}