#include <bits/stdc++.h>
#define mod 104659
 
using namespace std;
 
bool mp[30][30];
long long A[30][2005];
 
int main()
{
    ifstream fin("nrcuv.in");
    ofstream fout("nrcuv.out");
 
    int n, m, i, j, k;
    char c1, c2;
 
    fin >> n >> m;
    while(m--)
    {
        fin >> c1 >> c2;
        mp[c1-'a'][c2-'a'] = mp[c2-'a'][c1-'a'] = true;
    }
 
    for(i = 0; i < 26; ++i)
        A[i][1] = 1;
    
    for(i = 2; i <= n; ++i)
    {
        for(j = 0; j < 26; ++j)
        {
            m = 0;
            for(k = 0; k < 26; ++k)
                if(mp[j][k] == false)
                    m += A[k][i-1];
            A[j][i] = m % mod;
        }
    }
    m = 0;
    for(i = 0; i < 26; ++i)
        m += A[i][n];
 
    fout << m % mod;
}