#include <iostream>
#include <fstream>
#define mod 104659

using namespace std;

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

int n, m, dp[27][1001];
bool a[27][27];
char l1, l2;

void read(){
    fin >> n >> m;
    for(int i = 1; i <= m; i++){
        fin >> l1 >> l2;
        int nr1 = int(l1 - 'a' + 1), nr2 = int(l2 - 'a' + 1);
        a[nr1][nr2] = 1;
        a[nr2][nr1] = 1;
    }
}

void computeDp(){
    for(int i = 1; i <= 26; i++){
        dp[i][1] = 1;
    }
    for(int i = 2; i <= n; i++){
        for(int j = 1; j <= 26; j++){
            for(int k = 1; k <= 26; k++){
                if(a[j][k] == 0){
                    dp[j][i] = (dp[j][i] + dp[k][i - 1]) % mod;
                }
            }
        }
    }
}

void writeAnswer(){
    int rez = 0;
    for(int i = 1; i <= 26; i++){
        rez = (rez + dp[i][n]) % mod;
    }
    fout << rez;
}

int main()
{
    read();
    computeDp();
    writeAnswer();
    return 0;
}