There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.

Snuke cast Q spells to move the golems.

The i-th spell consisted of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.

However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.

Find the number of golems remaining after Snuke cast the Q spells.

Constraints

* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.

Input

Input is given from Standard Input in the following format:


N Q
s
t_1 d_1
\vdots
t_{Q} d_Q


Output

Print the answer.

Examples

Input

3 4
ABC
A L
B L
B R
A R


Output

2


Input

8 3
AABCBDBA
A L
B R
A R


Output

5


Input

10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L


Output

3
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline

def is_fall(S, start, end_point, magic_list):
    i = start
    for ml in magic_list:
        if i == -1 or i == len(S):
            break
        if S[i] == ml[0]:
            if ml[1] == 'L':
                i -= 1
            else:
                i += 1
        if i == end_point:
            return True
    return False




def bin_search(S,  magic_list, end_point):
    L = -1
    R = len(S)
    while 1:
        if R - L <= 1:
            if end_point == len(S):
                return R
            else:
                return L
        M = (L + R)/2
        res = is_fall(S, M, end_point, magic_list)
        if res == True:
            if end_point == len(S):
                R = M
            else:
                L = M
        else:
            if end_point == len(S):
                L = M
            else:
                R = M





def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [N, Q] = [int(input_raw[0]), int(input_raw[1])]
    input_raw = read_func().strip().split()
    S = input_raw[0]

    magic_list = []
    for i in range(Q):
        input_raw = read_func().strip().split()
        [t, s] = [(input_raw[0]), (input_raw[1])]
        magic_list.append((t, s))
    L_end = bin_search(S, magic_list, -1) + 1
    R_end = N - bin_search(S, magic_list, len(S))
    print N - L_end - R_end




if __name__ == '__main__':
    main()
