#include <fstream>

using namespace std;

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

const int mod=104659, max_size = 1e3 + 1;

int a[30][30], dp[max_size][30];

int main()
{
    int n, m;
    in >> n >> m;
    in.get();
    for(int i = 0; i < m; i++)
    {
        char x, y;
        in >> x;
        in.get();
        in >> y;
        in.get();
        a[x - 'a'][y - 'a'] = 1;
        a[y - 'a'][x - 'a'] = 1;
    }
    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(a[j][k] == 0)
                {
                    dp[i][j] += dp[i - 1][k];
                    dp[i][j] %= mod;
                }
            }
        }
    }
    int rez = 0;
    for(int i = 0; i < 26;i++)
    {
        rez += dp[n][i];
        rez %= mod;
    }
    out << rez;
    in.close();
    out.close();
    return 0;
}