const modulo=104659;
var v:array['a'..'z','a'..'z'] of longint;
    a:array['a'..'z',1..1000] of longint;
    n,m,i,sum:longint;
    j,k,x,y:char;
begin
assign(input,'nrcuv.in');reset(input);
assign(output,'nrcuv.out');rewrite(output);
readln(n,m);
for i:=1 to m do
begin
read(x);read(y);readln(y);
v[x,y]:=1;
v[y,x]:=1;
end;
for j:='a' to 'z' do a[j,1]:=1;
for i:=2 to n do
for j:='a' to 'z' do
for k:='a' to 'z' do
if v[j,k]=0 then a[j,i]:=(a[j,i]+a[k,i-1]) mod modulo;
sum:=0;
for j:='a' to 'z' do sum:=(sum+a[j,n]) mod modulo;
write(sum);
close(output);
end.