#include <bits/stdc++.h>
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL << 60) + 1e9;
const Int mod = (1e9) + 7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int, Int>;
template <class T>
T Max(T& a, T b) {
  return a = max(a, b);
}
template <class T>
T Min(T& a, T b) {
  return a = min(a, b);
}
template <class T1, class T2>
ostream& operator<<(ostream& o, pair<T1, T2> p) {
  return o << "(" << p.first << "," << p.second << ")";
}
template <class T1, class T2, class T3>
ostream& operator<<(ostream& o, tuple<T1, T2, T3> t) {
  return o << "(" << get<0>(t) << "," << get<1>(t) << "," << get<2>(t) << ")";
}
template <class T1, class T2>
istream& operator>>(istream& i, pair<T1, T2>& p) {
  return i >> p.first >> p.second;
}
template <class T>
ostream& operator<<(ostream& o, vector<T> a) {
  Int i = 0;
  for (T t : a) o << (i++ ? " " : "") << t;
  return o;
}
template <class T>
istream& operator>>(istream& i, vector<T>& a) {
  for (T& t : a) i >> t;
  return i;
}
vector<vector<int> > query(30);
vector<P> Query;
map<P, int> mem;
int N, Q;
string s;
int dfs(int time, int i) {
  if (i == -1 || i == N) return 0;
  time = *lower_bound(query[s[i] - 'A'].begin(), query[s[i] - 'A'].end(), time);
  if (time == Q) return 1;
  if (mem.count(P(time, i))) return mem[P(time, i)];
  char t = Query[time].first, d = Query[time].second;
  assert(t == s[i]);
  int res = 0;
  if (d == 'L')
    res = dfs(time + 1, i - 1);
  else
    res = dfs(time + 1, i + 1);
  return mem[P(t, i)] = res;
}
signed main() {
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);
  cin >> N >> Q;
  cin >> s;
  for (int i = 0; i < Q; i++) {
    char t, d;
    cin >> t >> d;
    query[t - 'A'].push_back(i);
    Query.push_back(P(t, d));
  }
  for (int i = 0; i < 30; i++) query[i].push_back(Q);
  int ans = 0;
  for (int i = 0; i < N; i++) ans += dfs(0, i);
  cout << ans << endl;
  return 0;
}
