#include <fstream>

using namespace std;

const int N = 1000;
const int NL = 26;
const int MOD = 104659;

bool incomp[NL][NL];
int dp[N+1][NL];

int main()
{
    ifstream in("nrcuv.in");
    ofstream out("nrcuv.out");
    int n, m;
    in >> n >> m;
    for (int i = 0; i < m; i++)
    {
        char x, y;
        in >> x >> y;
        incomp[x-'a'][y-'a'] = incomp[y-'a'][x-'a'] = true;
    }
    ///prima linie
    for (int j = 0; j < NL; j++)
    {
        dp[1][j] = 1;
    }
    for (int i = 2; i <= n; i++)
    {
        for (int j = 0; j < NL; j++)
        {
            for (int k = 0; k < NL; k++)
            {
                if (!incomp[k][j])
                {
                    dp[i][j] += dp[i-1][k];
                    if (dp[i][j] >= MOD)
                    {
                        dp[i][j] -= MOD;
                    }
                }
            }
        }
    }
    int nr_total = 0;
    for (int j = 0; j < NL; j++)
    {
        nr_total += dp[n][j];
        if (nr_total >= MOD)
        {
            nr_total -= MOD;
        }
    }
    out << nr_total << "\n";
    in.close();
    out.close();
    return 0;
}