#include<stdio.h>
#include<bitset>
#define mod 104659
using namespace std;

int i,j,n,k,m,a[1005][1005];

bitset <1005> fol[1005];

int main()
{
	freopen("nrcuv.in","r",stdin);
	freopen("nrcuv.out","w",stdout);
	
	scanf("%d %d\n",&n,&m);
	
	for(i=1;i<=m;++i) 
	{
		char c,l;
		scanf("%c %c\n",&c,&l);
		c=c-'a'+1;
		l=l-'a'+1;
		
		int x=int (c);
		int y=int (l);
		fol[x][y]=1;
		fol[y][x]=1;
	}
	
	for(i=1;i<=26;++i) a[i][1]=1;

	for(i=2;i<=n;++i) 
	{
		for(j=1;j<=26;++j) 
			for(k=1;k<=26;++k) 
				if(!fol[j][k])
				{    
					a[j][i]+=a[k][i-1];
				
					while(a[j][i]>mod) a[j][i]-=mod;
				}
	}
	
	int rez=0;
	for(i=1;i<=26;++i) 
	{
		rez+=a[i][n];
		while(rez>mod) rez-=mod;
	}
	
	
	printf("%d\n",rez);
	
	fclose(stdin);
	fclose(stdout);
	
	return 0;
}