#include<bits/stdc++.h>

using namespace std;

bool incomp[26][26];
int a[1005][26];

ifstream in("nrcuv.in");
ofstream out("nrcuv.out");

int main()
{
    int n,m;//n litere are cuvantul

    in>>n>>m;

    for(int i=0;i<m;i++){
        char c1,c2;
        in>>c1>>c2;
        incomp[c1-'a'][c2-'a']=incomp[c2-'a'][c1-'a']=true;
    }

    for(int i=0;i<26;i++){
        a[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(!incomp[j][k]){
                    a[i][j]+=a[i-1][k];
                    a[i][j]%=104659;
                }
            }
        }
    }
    int s=0;
    for(int i=0;i<26;i++){
        s+=a[n][i];
    }
    out<<s;
    return 0;
}