#include <bits/stdc++.h>
using namespace std;

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

int n, m, r, MOD = 104659;
int dp[27][1001], blocat[27][27];
char a, b;

int main(){

    fin >> n >> m;

    for (int i = 1; i <= m; i++){
        fin >> a >> b;
        blocat[a - 'a' +1][b - 'a' +1] = 1;
        blocat[b - 'a' +1][a - 'a' +1] = 1;
    }

    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 (blocat[j][k] != 1 && blocat[k][j] != 1){
                    dp[j][i] = (dp[j][i] + dp[k][i-1]) % MOD;
                }
            }
        }
    }

    for (int i = 1; i <=26; i++){
        r = (r + dp[i][n]) % MOD;
    }

    fout << r;
    return 0;
}