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
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;
using ll = long long;


//x番目のゴーレムを落とせるかを考える
bool checkLeft(int x, int k, string &s, vector<char> &t, vector<char> &d) {
	for (int i = 0; i < t.size(); i++)
	{
		if (t[i] == s[x])
		{
			x += (d[i] == 'L' ? -1 : 1);
		}

		if (s[x] == '_')
		{
			return x == k;
		}
	}
	return false;
}

int main() {
	int N, Q;
	string s;
	cin >> N >> Q;
	cin >> s;
	vector<char> t(Q);
	vector<vector<char>> d(2, vector<char>(Q));

	s = '_' + s + '_';

	for (int i = 0; i < Q; i++)
	{
		cin >> t[i] >> d[0][i];
		d[1][i] = (d[0][i] == 'L' ? 'R' : 'L');
	}

	int golem = N;
	for (int i = 0; i < 2; i++)
	{
		int lb = 0, m, ub = N + 1;
		while (ub - lb > 1) {
			m = (ub + lb) / 2;
			(checkLeft(m, 0, s, t, d[i]) ? lb : ub) = m;
		}

		golem -= lb;

		reverse(s.begin(), s.end());
	}

	cout << golem << endl;

	return 0;
}