#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 104659;
int D[26][1005];
int C[26][26];

int main() {
    ifstream fin("nrcuv.in");
    ofstream fout("nrcuv.out");
    int n, m;
    fin >> n >> m;

    for(int i = 0; i < 26; i++)
        for (int j = 0; j < 26; j++)
            C[i][j] = 0;

    for(int i = 0; i < m; i++){
        char l1, l2;
        if(fin >> l1 >> l2){
            int nl1 = l1 - 'a';
            int nl2 = l2 - 'a';
            if(nl1 >= 0 && nl1 < 26 && nl2 >= 0 && nl2 < 26)
                C[nl1][nl2] = 1;
        }
    }
    for(int l = 0; l < 26; l++)
        D[l][1] = 1;

    for(int i = 2; i <= n; i++)
        for(int l = 0; l < 26; l++){
            D[l][i] = 0;
            for (int lit = 0; lit < 26; lit++)
                if(C[lit][l] == 0){
                    D[l][i] = (D[l][i] + D[lit][i - 1]);
                    if(D[l][i] >= MOD)
                        D[l][i] %= MOD;}
        }
    int solutie = 0;
    for (int l = 0; l < 26; l++)
        solutie = (solutie + D[l][n]) % MOD;

    fout << solutie;
    return 0;
}