#include <fstream>
#include <bitset>
#define mod 104659
using namespace std;
ifstream fin ("nrcuv.in");
ofstream fout ("nrcuv.out");
int n,m,sum,x,y,i,j,g,d[1001][27];
char ch1,ch2;
bitset <27> fr[27];
int main()
{
    fin>>n>>m;
    for (i=1; i<=m; i++)
    {
        fin>>ch1>>ch2;
        x=ch1-'a'+1;
        y=ch2-'a'+1;
        fr[x][y]=fr[y][x]=1;
    }
    for (j=1; j<=26; j++)
        d[1][j]=1;
    for (i=2; i<=n; i++)
    {
        for (j=1; j<=26; j++)
        {
            for (g=1; g<=26; g++)
            {
                if (fr[j][g]==0)
                {
                    d[i][j]+=d[i-1][g];
                    d[i][j]%=mod;
                }
            }
        }
    }
    for (j=1; j<=26; j++)
    {
        sum+=d[n][j];
        sum%=mod;
    }
    fout<<sum;
    return 0;
}