#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <bitset>
   
using namespace std;
   
 
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define rforeach(it, c) for (__typeof__((c).rbegin()) it=(c).rbegin(); it != (c).rend(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))
#define COPY(dest, src) memcpy(dest, src, sizeof(dest))
#define ten(n) ((long long)(1e##n))
#define bin(n) (1LL << (n))
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define revrep(i, n) for (int i = (n); i >= 0; --i)
#define pb push_back

template <class T> void chmax(T& a, const T& b) { a = max(a, b); }
template <class T> void chmin(T& a, const T& b) { a = min(a, b); }

template <class T> void uniq(T& c) { sort(c.begin(), c.end()); c.erase(unique(c.begin(), c.end()), c.end()); }
 
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; }

template <typename T> void print_container(ostream& os, const T& c) { const char* _s = " "; if (!c.empty()) { __typeof__(c.begin()) last = --c.end(); foreach (it, c) { os << *it; if (it != last) cout << _s; } } }
template <typename T> ostream& operator<<(ostream& os, const vector<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const set<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const deque<T>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "( " << p.first << ", " << p.second << " )"; return os; }

template <class T> void print(T a, int n, const string& deli = " ", int br = 1) { for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } while (br--) cout << endl; }
template <class T> void print2d(T a, int w, int h, int width = -1, int br = 1) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) {    if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }

template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T> void input(T* a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }

void fix_pre(int n) { cout.setf(ios::fixed, ios::floatfield); cout.precision(10); }
void fast_io() { cin.tie(0); ios::sync_with_stdio(false); }
#define trace(x) (cout << #x << ": " << (x) << endl)
 
bool in_rect(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }
bool in_seg(int n, int l, int r) { return l <= n && n < r; } // n in [l, r)?

typedef long long ll;
typedef pair<int, int> pint;
 
// y(v): v>^<  y(^): ^>v<
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };

const double PI = acos(-1.0);
#define mp make_pair



typedef unsigned long long ull;
map<ull, vector<ull> > __base_pow;
class RollingHash
{
private:
    int n;
    string _s;
    ull base;
    vector<ull> _hash; // hash[i] -> [0, i)
    vector<ull>* base_pow;
    
    void expand_base_pow()
    {
        if (base_pow->empty())
            base_pow->push_back(1);
        while ((int)base_pow->size() <= n)
            base_pow->push_back(base * base_pow->back());
    }
public:
    RollingHash(const string& s, ull base)
        : n(0), base(base), _hash(1),
          base_pow(&__base_pow[base])
    {
        add(s);
    }
    RollingHash() {}

    void operator+=(const string& s) { add(s); }
    void operator+=(char c) { add(c); }

    int size() const { return n; }
    const string& str() const { return _s; }

    void add(const string& s)
    {
        int prev_n = n;
        n += s.size();
        _s += s;
        expand_base_pow();

        _hash.resize(n + 1);
        for (int i = prev_n; i < n; ++i)
            _hash[i + 1] = base * _hash[i] + _s[i];
    }
    void add(char c)
    {
        add(string(1, c));
    }

    // delete len chars from back
    void del(int len)
    {
        assert(len <= n);
        n -= len;
        _s.erase(_s.end() - len, _s.end());
        _hash.resize(n + 1);
    }
   
    // [i, j]
    ull hash(int i, int j)
    {
        assert(0 <= i && i <= j && j < n);
        return _hash[j + 1] - base_pow->at(j - i + 1) * _hash[i];
    }
    ull hash_by_len(int i, int len)
    {
        return hash(i, i + len - 1);
    }
};
int main()
{
    fast_io();

    int n, m;
    string s;
    cin >> n >> m >> s;

    RollingHash h(s, ten(9) + 7);
    int l = 0, r = 0;

    vector<ull> gen;
    while (m--)
    {
        string q;
        cin >> q;
        
        (q[0] == 'L' ? l : r) += q[1] == '+' ? 1 : -1;
        gen.pb(h.hash(l, r));
    }
    uniq(gen);
    cout << gen.size() << endl;
}

Measured memory_bytes: 15080