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.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.UncheckedIOException;
import java.util.StringTokenizer;
class Main{
	static String s;
	static int N,Q;
	static int[][] move;
	static int[] place;
	public static void main(String[] args) {
		SC sc=new SC(System.in);
		N=sc.nextInt();
		Q=sc.nextInt();
		s=sc.next();
		move=new int[Q][2];
		place=new int[N];
		for(int i=0; i<N; i++) {
			place[i]=s.charAt(i)-'A';
		}
		for(int i=0; i<Q; i++) {
			move[i][0]=((sc.next()).charAt(0))-'A';
			move[i][1]=0;
			String tmp=sc.next();
			if(tmp.charAt(0)=='L') {
				move[i][1]=-1;
			}
			else if(tmp.charAt(0)=='R') {
				move[i][1]=1;
			}
		}
		int MIGI=0;
		int HIDARI=0;
		int min=0;
		int max=N;
		while(max-min>1) {	//二分探索でどこまで落ちるかを考える	→
			int mid=(max+min)/2;
			boolean totatu=migi(mid);
			if(totatu) {
				max=mid;
			}
			else {
				min=mid;
			}
		}
		boolean minok=migi(min);
		boolean maxok=migi(max);
		if(minok) {
			MIGI=min;
		}
		else if(maxok) {
			MIGI=max;
		}
		else {
			MIGI=-1;
		}

		min=0;
		max=N;
		while(max-min>1) {
			int mid=(max+min)/2;
			boolean totatu=hidari(mid);
			if(totatu) {
				min=mid;
			}
			else {
				max=mid;
			}
		}
		minok=hidari(min);
		maxok=hidari(max);
		if(maxok) {
			HIDARI=max;
		}
		else if(minok) {
			HIDARI=min;
		}
		else {
			HIDARI=-1;
		}
		int ans=N;
		if(MIGI>=0) {
			ans-=(N-MIGI);
		}
		if(HIDARI>=0) {
			ans-=(HIDARI+1);
		}
		pl(ans);
	}
	static boolean migi(int mid) {
		int now=mid;
		if(mid==N) {
			return true;
		}
		else {
			for(int i=0; i<Q; i++) {
				if(move[i][0]==place[now]) {
					if(move[i][1]==1) {
						now++;
					}
					else if(move[i][1]==-1) {
						now--;
					}
				}
				if(now==N) {
					return true;
				}
				else if(now<0) {
					return false;
				}
			}
			return false;
		}
	}

	static boolean hidari(int mid) {
		int now=mid;
		if(mid==N) {
			return false;
		}
		else {
			for(int i=0; i<Q; i++) {
				if(move[i][0]==place[now]) {
					if(move[i][1]==1) {
						now++;
					}
					else if(move[i][1]==-1) {
						now--;
					}
				}
				if(now<0) {
					return true;
				}
				else if(now>=N) {
					return false;
				}
			}
			return false;
		}
	}
	static class SC {
		private BufferedReader reader = null;
		private StringTokenizer tokenizer = null;
		public SC(InputStream in) {
			reader = new BufferedReader(new InputStreamReader(in));
		}
		public String next() {
			if (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new UncheckedIOException(e);
				}
			}
			return tokenizer.nextToken();
		}
		public int nextInt() {
			return Integer.parseInt(next());
		}
		public long nextLong() {
			return Long.parseLong(next());
		}
	}
	public static void pl(Object o) {
		System.out.println(o);
	}
	public static void pl() {
		System.out.println();
	}
	public static void p(Object o) {
		System.out.print(o);
	}
}