#include <bits/stdc++.h>

using namespace std;

const int mod = 104659;

int dp[1005][30];
bool forbid[30][30];

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