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;

class Main {

  public enum Status {
    LEFT, RIGHT, OK;
  }

  public static Status LeftRightOk(String s, String[] t, String[] d, int index) {
    char currchar = s.charAt(index);
    for (int i = 0; i < t.length; i++) {
      if (currchar == t[i].charAt(0)) {
        if (d[i].equals("R")) {
          if (index != s.length() - 1) {
            currchar = s.charAt(++index);
          } else {
            return Status.RIGHT;
          }
        } else {
          if (index != 0) {
            currchar = s.charAt(--index);
          } else {
            return Status.LEFT;
          }
        }
      }
    }
    return Status.OK;
  }

  public static int searchLeftOkIdx(String s, String[] t, String[] d) {
    int ok = s.length();
    int left = -1;
    int mid = (ok + left) / 2;
    while (ok - left > 1) {
      if (LeftRightOk(s, t, d, mid) == Status.LEFT) {
        left = mid;
      } else {
        ok = mid;
      }
      mid = (ok + left) / 2;
    }
    return ok;
  }

  public static int searchRightOkIdx(String s, String[] t, String[] d) {
    int ok = -1;
    int right = s.length();
    int mid = (ok + right) / 2;
    while (right - ok > 1) {
      if (LeftRightOk(s, t, d, mid) == Status.RIGHT) {
        right = mid;
      } else {
        ok = mid;
      }
      mid = (ok + right) / 2;
    }
    return ok;
  }

  public static void main(String[] args) {
    {
      {
        Scanner scanner = new Scanner(System.in);
        int N = Integer.parseInt(scanner.next());
        int Q = Integer.parseInt(scanner.next());
        String s = scanner.next();
        String[] t = new String[Q];
        String[] d = new String[Q];
        for (int i = 0; i < Q; i++) {
          t[i] = scanner.next();
          d[i] = scanner.next();
        }
        scanner.close();
        int leftiOkdx = searchLeftOkIdx(s, t, d);
        int rightOkidx = searchRightOkIdx(s, t, d);
        int ans = rightOkidx - leftiOkdx >= 0 ? rightOkidx - leftiOkdx + 1 : 0;
        System.out.println(ans);

      }
    }
  }

}
