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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;

public class Main {
    private static int DIRECTION_LEFT = -1;
    private static int DIRECTION_RIGHT = -1;
    public static void main(String[] args) {
        Main main = new Main();
        main.solve();
    }
    public void solve() {
        Scanner scan = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        int N = scan.nextInt();
        int Q = scan.nextInt();
        String s = scan.next();
        List<Query> list = new ArrayList<>();
        for (int i = 0; i < Q; i++) {
            char c = scan.next().toCharArray()[0];
            char direction = scan.next().toCharArray()[0];
            int d = 'L' == direction ? -1 : 1;
            Query q = new Query();
            q.c = c;
            q.d = d;
            list.add(q);
        }
        s = "@" + s + "@";
        Status status = new Status(N, s, list);
        int left_index = find(status, 0, N + 1, 0);
        int right_index = find(status, N + 1, 0, N + 1);
        if (right_index <= left_index) {
            System.out.println(0);
        } else {
            System.out.println(right_index - left_index - 1);
        }
    }

    private int find(Status status, int lower, int upper, int expected_position) {
        while (Math.abs(upper - lower) > 1) {
            int middle = (lower + upper) / 2;
            if (status.apply_move(middle, expected_position)) {
                lower = middle;
            } else {
                upper = middle;
            }
        }
        boolean x = status.apply_move(lower, expected_position);
        if (x) {
            return lower;
        }
        return upper;
    }

    class Status {
        private int N;
        private int[] data;
        private char[] problem;
        private List<Query> queries;
        Status(int N, String s, List<Query> queries) {
            this.N = N;
            HashMap<Character, List<Integer>> m = new HashMap<>();
            this.problem = s.toCharArray();
            this.queries = queries;
            init();
        }
        void init() {
            int[] data = new int[N+2];
            Arrays.fill(data, 1);
            data[0] = 0;
            data[N+1] = 0;
            this.data = data;
        }
        boolean apply_move(int position, int expected_position) {
            int current_position = position;
            if (is_end(current_position, expected_position)) {
                return true;
            }
            for(Query q : queries) {
                if (problem[current_position] == q.c) {
                    current_position += q.d;
                }
                if (is_end(current_position, expected_position)) {
                    return true;
                }
            }
            return false;
        }
        boolean is_end(int current_position, int expected_position) {
            return current_position == expected_position;
        }
    }
    class Query {
        char c;
        int d;
    }
}
