#include<iostream>
#include<string>
#include<unordered_set>
#include<set>
#include<vector>
using namespace std;
typedef unsigned long long int ull;


int main(){
  int n, m;
  std::cin >> n >> m;
  string s;
  std::cin >> s;
  ull r = 1, l = 0;
  vector<ull> vb(n + 10, 1), vh(n + 10, 0);
  ull base = 1e9 + 7;
  vh[0] = s[0];
  for (int i = 0; i < n - 1; i++) {
    vb[i + 1] = vb[i]*base;
    vh[i + 1] = vh[i]*base + s[i + 1];
  }
  ull val = s[0];
  set<ull> bucket;
  for (int i = 0; i < m; i++) {
    string ss;
    std::cin >> ss;
    if(ss == "R++"){
      val = val*base + s[r];
      r++;
    }else if(ss == "R--"){
      if(l != 0)val = vh[r - 2] - vb[r - l - 1]*vh[l - 1];
      else val = vh[r - 2];
      r--;
    }else if(ss == "L++"){
      val = val - s[l]*vb[r - l - 1];
      l++;
    }else{
      val = val + s[l - 1]*vb[r - l];
      l--;
    }
    bucket.insert(val);
  }
  std::cout << bucket.size() << std::endl;
  return 0; 
}