#include<cstdio>
using namespace std;

int litOK[26][26], dp[1001][26];
//dp[i][j] = cate cuvinte de lungime i, care se termina cu a j-a litera pot forma

int main(){
	freopen("nrcuv.in", "r", stdin), freopen("nrcuv.out", "w", stdout);
	int n, m, i, j, k, sum;
	char lit1, lit2;
	scanf ("%d %d", &n, &m);
	
	for (i = 0; i < 26; i++)
		for (j = 0; j < 26; j++) litOK[i][j] = true;
	
	for (i = 1; i <= m; i++){
		do scanf("%c", &lit1);
			while (!(lit1 >= 'a' && lit1 <= 'z'));
		do scanf("%c", &lit2);
			while (!(lit2 >= 'a' && lit2 <= 'z'));
		litOK[lit1 - 'a'][lit2 - 'a'] = false;
		litOK[lit2 - 'a'][lit1 - 'a'] = false;
	}

	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 (litOK[j][k]) dp[i][k] = (dp[i][k] + dp[i-1][j]) % 104659;
	
	for (i = sum = 0; i < 26; i++) sum = (sum + dp[n][i]) % 104659;
	printf("%d\n", sum);
	
	return 0;
}