#include <bits/stdc++.h>

using namespace std;

const int mod = 104659;

int dp[1005][30];
vector<int> forbid[30];

bool found(char a, char b){
    if(forbid[a - 'a' + 1].empty() || forbid[b - 'a' + 1].empty())
        return 0;
    int rez = 0, pas = 1 << 30;
    while(pas){
        if(rez + pas < forbid[a - 'a' + 1].size() && forbid[a - 'a' + 1][rez + pas] < b - 'a' + 1)
            rez += pas;
        pas /= 2;
    }
    rez++;
    if(forbid[a - 'a' + 1][rez] == (b - 'a' + 1))
        return 1;
    if(rez == 1 && forbid[a - 'a' + 1][rez - 1] == (b - 'a' + 1))
        return 1;
    return 0;
}

int main()
{
    ifstream fin("nrcuv.in");
    ofstream fout("nrcuv.out");
    int n, m;
    fin >> n >> m;
    char c1, c2;
    while(m){
        fin >> c1 >> c2;
        if(c1 == c2)
            forbid[c1 - 'a' + 1].push_back(c2 - 'a' + 1);
        else if(!found(c1, c2)){
            forbid[c1 - 'a' + 1].push_back(c2 - 'a' + 1);
            forbid[c2 - 'a' + 1].push_back(c1 - 'a' + 1);
        }
        if(!forbid[c1 - 'a' + 1].empty())
            sort(forbid[c1 - 'a' + 1].begin(), forbid[c1 - 'a' + 1].end());
        m--;
    }
    for(int i = 1; i <= 26; ++i)
        dp[1][i] = 1;
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= 26; ++j){
            for(int k = 1; k <= 26; ++k){
                dp[i][j] += dp[i - 1][k] % mod;
                dp[i][j] %= mod;
            }
            for(int k = 0; k < int(forbid[j].size()); ++k){
                dp[i][j] -= dp[i - 1][forbid[j][k]] % mod;
                dp[i][j] = (dp[i][j] + mod) % mod;
            }
        }
    }
    int sum = 0;
    for(int i = 1; i <= 26; ++i){
        sum += dp[n][i];
        sum %= mod;
    }
    fout << sum;
    return 0;
}