#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <numeric>
#include <cstring>
#include <string>
#include <queue>
#include <set>
#include <cmath>
#include <fstream>
#include <cstdlib>
#include <map>
#define pb push_back
#define mp make_pair
#define INF numeric_limits<int>::max()
#define bit(x) (-x)&x
#define int64 long long
using namespace std;
ifstream in("nrcuv.in");
ofstream out("nrcuv.out");
#define mod 104659
#define ab(x) (x-'a'+1)
int a[30][30],dp[1002][30],n,m;
int main()
{
    in>>n>>m;
    for(;m;m--)
    {
        char x,y;
        in>>x>>y;
        a[ab(x)][ab(y)]=1;
        a[ab(y)][ab(x)]=1;
    }
    for(int i=1;i<=26;i++)
        dp[1][i]=1;
    for(int i=2;i<=n;i++)
    {
        for(int j=1;j<=26;j++)
        for(int k=1;k<=26;k++)
        if(a[j][k]==0)
            dp[i][k]=(dp[i][k]+dp[i-1][j])%mod;
    }
    int sol=0;
    for(int i=1;i<=26;i++)
        sol=(sol+dp[n][i])%mod;
    out<<sol<<'\n';
    return 0;
}