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 java.util.*;

public class Main {

    static int q;
    static int n;
    static char[] charArr;
    static char[] tArr;
    static char[] dArr;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        q = sc.nextInt();
        charArr = ("?" + sc.next() + "?").toCharArray();

        tArr = new char[q];
        dArr = new char[q];
        for (int i = 0; i < q; i++) {
            tArr[i] = sc.next().charAt(0);
            dArr[i] = sc.next().charAt(0);
        }

        int ans0 = 1;
        int ansN1 = n;

        int right = n + 1;
        int left = 0;

        // 0よう
        while (true) {
            if (right - left <= 1) {
                ans0 = left;
                break;
            }
            int middle = (right + left) / 2;
            if (check0(middle)) {
               left = middle;
            } else {
                right = middle;
            }
        }

        right = n + 1;
        left = 0;
        // n+1よう
        while (true) {
            if (right - left <= 1) {
                ansN1 = right;
                break;
            }
            int middle = (right + left) / 2;
            if (checkN1(middle)) {
                right = middle;
            } else {
                left = middle;
            }
        }


        System.out.println(ansN1 - ans0 - 1);

    }

    static boolean check0(int idx) {
        int currentIdx = idx;
        for (int i = 0; i < q; i++) {
            char t = tArr[i];
            char d = dArr[i];
            if (charArr[currentIdx] == t) {
                if (d == 'R') {
                    currentIdx++;
                } else {
                    currentIdx--;
                }
            }
            if (currentIdx == 0) {
                return true;
            } else if (currentIdx == n + 1){
                return false;
            }
        }
        return false;
    }

    static boolean checkN1(int idx) {
        int currentIdx = idx;
        for (int i = 0; i < q; i++) {
            char t = tArr[i];
            char d = dArr[i];
            if (charArr[currentIdx] == t) {
                if (d == 'R') {
                    currentIdx++;
                } else {
                    currentIdx--;
                }
            }
            if (currentIdx == n + 1) {
                return true;
            } else if (currentIdx == 0){
                return false;
            }
        }
        return false;
    }


}
