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.Scanner;
 
public class Main {
 
	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		int N = 0;
		int Q = 0;
		String s;
		Scanner sc = new Scanner(System.in);
		N = Integer.parseInt(sc.next());
		Q = Integer.parseInt(sc.next());
		s = sc.next();
		int n;
		String Golem[] = new String[N];
		for (n = 0; n < N; n++) {
			Golem[n] = s.substring(n, n + 1);
		}
		int l = 0;
		int L = 0;
		int r = N-1;
		int R = 0;
		int m = 0;
		String t[] = new String[Q];
		String d[] = new String[Q];
		for (n = 0; n < Q; n++) {
			t[n] = sc.next();
			d[n] = sc.next();
		}
		while (r >=l) {
			// 左側
			m = (l + r) / 2;
			if (simulate(Golem, t, d, Q, m, N) == -1)
				l = m + 1;
			else
				r = m - 1;
		}
		L = r;
		l = 0;
		r = N-1;
		while (r >=l) {
			// 右側
			m = (l + r) / 2;
			if (simulate(Golem, t, d, Q, m, N) == 1)
				r = m - 1;
			else
				l = m + 1;
		}
		R = r;
		sc.close();
		System.out.println(R - L);
	}
 
	static int simulate(String Golem[], String t[], String d[], int Q, int m, int N) {
		int temp = 0;
		temp = m;
 
		for (int i = 0; i < Q; i++) {
			if (Golem[temp].equals(t[i])) {
				if (d[i].equals("R"))
					temp++;
				else
					temp--;
				if (temp < 0)
					return -1;// 左に落下
				if (temp >= N)
					return 1;// 右に落下
			}
		}
		return 0;
	}
}