import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;

alias sread = () => readln.chomp();
alias Point2 = Tuple!(long, "y", long, "x");

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}

void minAssign(T, U = T)(ref T dst, U src)
{
    dst = cast(T) min(dst, src);
}

void main()
{
    long N, Q;
    scan(N, Q);
    auto S = sread();
    auto M = new long[][](2, N);
    auto m = new long[][](26);
    M[0][] = 1;
    foreach (i, c; S)
        m[c - 'A'] ~= i;
    foreach (i; 0 .. Q)
    {
        M[(i + 1) & 1][] = M[i & 1][];
        string T, D;
        scan(T, D);
        // writeln(m[T[0] - 'A']);
        foreach (j; m[T[0] - 'A'])
        {
            if (D == "R")
            {
                M[(i + 1) & 1][j] -= M[i & 1][j];
                if (j + 1 < N)
                    M[(i + 1) & 1][j + 1] += M[i & 1][j];
                // writeln(j + 1 < N);
            }
            else
            {
                M[(i + 1) & 1][j] -= M[i & 1][j];
                if (0 < j)
                    M[(i + 1) & 1][j - 1] += M[i & 1][j];
            }
        }
    }
    writeln(M[(N + 1) & 1].sum());
}
