#include <bits/stdc++.h>

#define ll long long

using namespace std;

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

const int SIZE = 'z' + 1;
const int NSIZE = 1001;
const int mod = 104659;

int n, m;
// invalid[i][j] = 1 daca j nu poate fi dupa i
bool invalid[SIZE][SIZE];
// match[i] este multimea char-urilor care pot fi puse dupa i
vector<char> match[SIZE];
// dp[i][j] = nr. de cuv. posibile de lungime i cu ultimul caracter j
int dp[NSIZE][SIZE];

void read();
void solve();

int main()
{
    read();
    solve();
    return 0;
}

void read()
{
    fin >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        char a, b;
        fin >> a >> b;
        invalid[a][b] = 1;
        invalid[b][a] = 1;
    }
}

void solve()
{
    for(char i = 'a'; i <= 'z'; ++i)
        for(char j = 'a'; j <= 'z'; ++j)
            if(!invalid[i][j])
                match[i].push_back(j);

    for(char i = 'a'; i <= 'z'; ++i)
        dp[1][i] = 1;

    for(int i = 2; i <= n; ++i)
        for(char j = 'a'; j <= 'z'; ++j)
            for(auto ch : match[j])
                dp[i][j] = (dp[i][j] + dp[i - 1][ch]) % mod;

    int sol = 0;
    for(char i = 'a'; i <= 'z'; ++i)
        sol = (sol + dp[n][i]) % mod;

    fout << sol;
}