#include <bits/stdc++.h>
#define mod 104659

using namespace std;

ifstream f("nrcuv.in");
ofstream g("nrcuv.out");

int n, m, c[30][30], d[1005][30];

int main(void) {
    f >> n >> m;

    for (int i = 0; i < m; i++) {
        char a, b;
        f >> a >> b;

        c[a - 'a'][b - 'a'] = 1;
        c[b - 'a'][a - 'a'] = 1;
    }
    
    for (int i = 0; i < 26; i++)
        d[0][i] = 1;
    
    
    for (int i = 1; i <= n; i++) 
        for (int j = 0; j < 26; j++)
            for (int k = 0; k < 26; k++) 
                if (c[j][k] != 1 && c[k][j] != 1)
                    d[i][j] = (d[i][j] + d[i - 1][j]) % mod;
    
    long long int sum = 0;
    for(int i = 0; i < 26; i++)
        sum = (d[n - 1][i] + sum) % mod;
        
        
    g << sum;
    
    return 0;
}