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<bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;

typedef long long LL;

const int maxn=2e5+5;

int n,m,dr[maxn];
char s[maxn],inD[maxn];

char Read()
{
	char ch=getchar();
	while (ch<'A' || ch>'Z') ch=getchar();
	return ch;
}

int check(int x)
{
	fo(i,1,m) if (s[x]==inD[i])
	{
		x+=dr[i];
		if (x<1 || x>n) break;
	}
	return x;
}

int main()
{
	scanf("%d %d",&n,&m);
	scanf("%s",s+1);
	fo(i,1,m)
	{
		char ch1=Read(),ch2=Read();
		inD[i]=ch1;
		dr[i]=(ch2=='L') ?-1 :1 ;
	}
	
	int l=1, r=n;
	while (l<=r)
	{
		int mid=(l+r)>>1;
		if (check(mid)==0) l=mid+1; else r=mid-1;
	}
	int ans1=l-1;
	
	l=1, r=n;
	while (l<=r)
	{
		int mid=(l+r)>>1;
		if (check(mid)==n+1) r=mid-1; else l=mid+1;
	}
	int ans2=r+1;
	
	printf("%d\n",max(0,ans2-1-ans1));
}