#include<cstdio>

using namespace std;

char l1,l2;
int n,m,total,i,j,k;
const int mod=104659;
int A[27][27];
int nr[1005][27];
int main()
{
	freopen("nrcuv.in","r",stdin);
	
	freopen("nrcuv.out","w",stdout);
	
	scanf("%d%d\n",&n,&m);
	
	for(i=1;i<=m;++i){
		scanf("%c %c\n",&l1,&l2);
		A[l1 - 'a' + 1][l2 - 'a' + 1]=1;
		A[l2 - 'a' +1][l1-'a'+1] = 1;
	}
	
	for( i = 1 ; i <= 26 ; ++i ) 
		nr[1][i] = 1;
	
	for(i=2;i<=n; ++i){
		for(j=1;j<=26;++j){
			for( k = 1 ; k <= 26 ; ++k ){ 
				if ( A[k][j] == 0 ) 
					nr[i][j] += nr[i - 1][k],
					nr[i][j] %= mod;
			}
		}
	}
	for(i=1;i<=26;++i){
		total+=nr[n][i];
		total%=mod;
	}
	printf("%d",total);
	return 0;
}