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

public class Main {
    static int n;
    static int q;
    static char[] s;
    static char[] t;
    static char[] d;
    static Scanner sc;

    public static void main(String[] args) {
        sc = new Scanner(System.in);
        n = sc.nextInt();
        q = sc.nextInt();
        s = sc.next().toCharArray();
        t = new char[q];
        d = new char[q];
        for (int i = 0; i < q; i++) {
            t[i] = sc.next().charAt(0);
            d[i] = sc.next().charAt(0);
        }
        int lft = bsearchl()+1;
        if(!isOkl(0)) {
            lft = 0;
        }
        int rgt = bsearchr();
        if(!isOkr(n-1)) {
            rgt = n;
        }
        int sum = lft + (n - rgt);
        System.out.println(Math.max(0, n - sum));

    }
    static int bsearchl() {
        int lft = 0;
        int rgt = n;
        int mid = 0;
        while(rgt - lft > 1) {
            mid = (lft + rgt) / 2;
            if(isOkl(mid)) {
                lft = mid;
            }
            else {
                rgt = mid;
            }
        }
        return lft;
    }

    static boolean isOkl(int index) {
        for (int i = 0; i < q; i++) {
            if(index == -1) {
                return true;
            }
            if (index == n){
                return false;
            }
            if(t[i] == s[index]) {
                if(d[i] == 'L') {
                    index--;
                }
                else {
                    index++;
                }
            }
        }
        if(index == -1) {
            return true;
        }
        return false;
    }

    static int bsearchr() {
        int lft = -1;
        int rgt = n-1;
        int mid = 0;
        while(rgt - lft > 1) {
            mid = (lft + rgt) / 2;
            if(isOkr(mid)) {
                rgt = mid;
            }
            else {
                lft = mid;
            }
        }
        return rgt;
    }

    static boolean isOkr(int index) {
        for (int i = 0; i < q; i++) {
            if(index == n) {
                return true;
            }
            if(index == -1) {
                return false;
            }
            if(t[i] == s[index]) {
                if(d[i] == 'L') {
                    index--;
                }
                else {
                    index++;
                }
            }
        }
        if(index == n) {
            return true;
        }
        return false;
    }
}

