#include <bits/stdc++.h>
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");

int n, m, fr[30][30], a[1005][30], sum, mod = 104659;

int main() {
    fin >> n >> m;
    for (int i = 0; i < m; i++) {
        char l1, l2;
        
        fin >> l1 >> l2;
        
        fr[l1 - 'a'][l2 - 'a'] = 1;
        fr[l2 - 'a'][l1 - 'a'] = 1;
    }
    
    for (int i = 0; i < 26; i++) {
        a[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 (fr[j][k] != 1 && fr[k][j] != 1)
                    a[i][j] = (a[i][j] + a[i - 1][k]) % mod;
    
    long long sum = 0;
    for (int i = 0; i < 26; i++) {
        sum = (a[n - 1][i] + sum) % mod;
    }
    
    fout << sum;
    
    return 0;
}