#include <bits/stdc++.h>

using namespace std;

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

int n, m;
bool bad[30][30];
int dp[1005][30];

int main() {
    fin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        char x, y;
        fin >> x >> y;
        bad[x - 'a'][y - 'a'] = true;
        bad[y - 'a'][x - 'a'] = true;
    }
    fin.close();
    
    for (int i = 0; i < 26; ++i) {
        dp[1][i] = 1;
    }
    
    for (int i = 2; i <= n; ++i) {
        for (int j = 0; j < 26; ++j) {
            for (int k = 0; k < 26; ++k) {
                if (!bad[k][j]) {
                    dp[i][j] = (dp[i][j] + dp[i - 1][k]) % 104659;
                }
            }
        }
    }
    
    int ans = 0;
    for (int i = 0; i < 26; ++i) {
        ans = (ans + dp[n][i]) % 104659;
    }
    
    fout << ans << "\n";
    return 0;
}