#include <iostream>
#include <fstream>
#include <algorithm>

#define LLI long long int
#define N 2005

using namespace std;

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

LLI const MODULO = 104659;

LLI numberExceptions, totalLetters;

pair <char, char> Pair[N];

LLI power(LLI number, LLI exponent){
    number %= MODULO;
    if ( exponent == 0 )
        return 1;
    if ( exponent == 1 )
        return number;
    if ( exponent % 2 )
        return ( power( number*number, (exponent-1) / 2) * number) % MODULO;
    else
        return power( number*number, exponent/2) % MODULO;
}

inline void readVariables(void){
    f >> totalLetters >> numberExceptions;
    for ( int index = 1; index <= numberExceptions; index++ ){
        f >> Pair[index].first >> Pair[index].second;
        if ( Pair[index].first > Pair[index].second )
            swap (Pair[index].first, Pair[index].second);
    }
}

inline void solveProblem(void){
    sort (Pair+1, Pair+numberExceptions+1);

    LLI contor = 0;
    for ( int index = 1; index <= numberExceptions; index++ ){
        if ( Pair[index] != Pair[index-1] ){
            contor++;
            if ( Pair[index].first != Pair[index].second ){
                contor++;
            }
        }
    }
    g << ( (power(26, totalLetters) % MODULO) - ( (power(26, totalLetters-2) * (totalLetters-1) * contor) %MODULO) + MODULO ) % MODULO;
}

int main(){
    readVariables();
    solveProblem();
    return 0;
}