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);
    M[0][] = 1;
    foreach (i; 0 .. Q)
    {
        M[(i + 1) & 1][] = 0;
        string T, D;
        scan(T, D);
        foreach (j, c; S)
            if (c == T[0])
            {
                if (D == "R" && j + 1 < N)
                {
                    M[(i + 1) & 1][j + 1] += M[i & 1][j];
                }
                else if (D == "L" && 0 < j)
                {
                    M[(i + 1) & 1][j - 1] += M[i & 1][j];
                }
            }
            else
            {
                M[(i + 1) & 1][j] += M[i & 1][j];
            }
    }
    writeln(M[Q & 1].sum());
}
