#include <iostream>
#include <fstream>

using namespace std;

const int MOD = 104659;
const int NMAX = 1000;
const int LMAX = 26;

int vecini[LMAX][LMAX];
int dp[NMAX + 1][LMAX]; // cuv de n litere care se termina in o anumita litera

int main()
{
    ifstream fin("nrcuv.in");
    ofstream fout("nrcuv.out");

    int n, m;
    fin >> n >> m;

    for(int i = 1; i <= m; i++){
        char c1, c2;
        fin >> c1 >> c2;
        vecini[c1 - 'a'][c2 - 'a'] = 1;
        vecini[c2 - 'a'][c1 - 'a'] = 1;
    }

    for(int i = 0; i < LMAX; i++){
        dp[1][i] = 1;
    }

    for(int i = 2; i <= n; i++){
        for(int j = 0; j < LMAX; j++){
            for(int k = 0; k < LMAX; k++){
                if(vecini[j][k] == 0){
                    dp[i][j] = dp[i][j] + dp[i - 1][k];
                    if(dp[i][j] >= MOD)
                        dp[i][j] -= MOD;
                }
            }
        }
    }


    int rez = 0;
    for(int i = 0; i < LMAX; i++){
        rez += dp[n][i];
        if(rez >= MOD)
            rez -= MOD;
    }

    fout << rez;

    fin.close();
    fout.close();
    return 0;
}