#include <fstream>
#define mod 104659
using namespace std;
ifstream fin("nrcuv.in");
ofstream fout("nrcuv.out");
int n,m,i,j,k,sol,dp[1001][26];
char x,y;
bool f[26][26];
int main() {
    fin>>n>>m;
    while (m--) {
        fin>>x>>y;
        f[x-'a'][y-'a']=1;
        f[y-'a'][x-'a']=1;
    }
    for (i=0;i<26;i++)
        dp[1][i]=1;
    for (i=2;i<=n;i++)
        for (j=0;j<26;j++)
            for (k=0;k<26;k++)
                if (f[k][j]==0)
                    dp[i][j]=(dp[i][j]+dp[i-1][k])%mod;
    for (i=0;i<26;i++)
        sol=(sol+dp[n][i])%mod;
    fout<<sol;
    return 0;
}