#include<bits/stdc++.h>

#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define sz size
#define pb push_back
#define mp make_pair
#define bg begin
#define nd end
using namespace std;

#define int long long

const int maxn = 100003;
const int maxk = 1003;

int langa[30][30];
int dp[maxk][30];
int n,m;
char l1,l2;

const int MODN = 104659;

int get(char x) {
	return x - 'a';
}

int add(int a,int b) {
	return (a + b) % MODN;
}

int32_t main() {

	freopen("nrcuv.in", "r", stdin);
	freopen("nrcuv.out", "w", stdout);

	ios_base::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> m;
	for (int i = 0; i < m; ++i) {
		cin >> l1 >> l2;
		langa[get(l1)][get(l2)] = 1;
		langa[get(l2)][get(l1)] = 1;
	}
	for (int i = 0; i < 30; ++i) dp[1][i] = 1;
	for (int i = 2; i <= n; ++i) {
		for (int j = 0; j < 26; ++j) {
			for (int k = 0; k < 26; ++k) {
				if (!langa[j][k]) dp[i][j] = add(dp[i][j],dp[i - 1][k]);
			}
		}
	}
	int res = 0;
	for (int i = 0; i < 26; ++i) res = add(res,dp[n][i]);
	cout << res << '\n';

	return 0;
}