#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>

using namespace std;

#define C 10007
typedef unsigned long long int ull;

vector<ull> power_cache;

ull power(int p) {
    return power_cache[p];
}

int n, m;
string s;
int li, ri;

void init() {
    cin >> n >> m >> s;
    li = ri = 0;
    power_cache.resize(n);
    power_cache[0] = 1;
    for (int i = 1; i < n; i++) {
        power_cache[i] = power_cache[i-1] * C;
    }
}


map<int, map<int, ull> > cache;

ull calc_hash() {
    ull hash = s[li];
    for (int i = li+1; i <= ri; i++) 
        hash = hash * C + s[i];
    return hash;
}

void solve() {
    string q;
    set<ull> hashes;
    ull hash;
    cache[li][ri] = s[0];
    for (int i = 0; i < m; i++) {
        cin >> q;
        if (q == "R++") {
            ri++;
            if (cache[li][ri] != 0) {
                hash = cache[li][ri];
            } else if (cache[li][ri-1] != 0) {
                hash = cache[li][ri-1] * C + s[ri];
            } else {
                hash = calc_hash();
            }
        } else if (q == "R--") {
            ri--;
            if (cache[li][ri] != 0) {
                hash = cache[li][ri];
            } else {
                hash = calc_hash();
            }
        } else if (q == "L++") {
            li++;
            if (cache[li][ri] != 0) {
                hash = cache[li][ri];
            } else if (cache[li-1][ri] != 0) {
                hash = cache[li-1][ri] - s[li-1] * power(ri-li+1);
            } else {
                hash = calc_hash();
            }
        } else {
            li--;
            if (cache[li][ri] != 0) {
                hash = cache[li][ri];
            } else if (cache[li+1][ri] != 0) {
                hash = cache[li+1][ri] + s[li] * power(ri-li);
            } else {
                hash = calc_hash();
            }
        }
        cache[li][ri] = hash;
        hashes.insert(hash);
    }

    cout << hashes.size() << endl;
}

int main() {
    init();
    solve();
    return 0;
}