#include <iostream>
#include <iomanip>
#include <fstream>
#include <string>
#include <array>
#include <utility>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <bitset>
#include <tuple>
#include <cmath>
#include <complex>
#include <algorithm>
#include <utility>
#include <regex>
#include <cstdint>
#include <numeric>
#include <functional>
#include <cassert>

using namespace std;
using ll = long long;
using ull = unsigned long long;

constexpr ll INF = 1'000'000'000'000'000'000;
namespace utils{
#define ALL(x) begin(x), end(x)
#define rALL(x) rbegin(x), rend(x)
    template<class T, class Compare> using p_queue = priority_queue<T, vector<T>, Compare>;
    template<class T> using min_queue = p_queue<T, greater<T>>;
    template<class T> using max_queue = p_queue<T, less<T>>;

    template<class T> bool min_update(T& X, const T& A){ if(X > A) {X = A; return true;} return false; }
    template<class T> bool max_update(T& X, const T& A){ if(X < A) {X = A; return true;} return false; }
    using V_Set = unordered_set<int>;
    using E_Set = unordered_map<int, V_Set>;

    ll operator"" _64(unsigned long long x){ return ll(x); }
    ull operator"" _64u(unsigned long long x){ return ull(x); }

    template<class T>
    vector<T> make_mdvector(int n, T t){
        return vector<T>(n, t);
    }
    template<class ...Ts>
    auto make_mdvector(int n, Ts ... ts){
        return vector<decltype(make_mdvector(ts...))>(n, make_mdvector(ts...));
    }

    template<class T>
    istream& operator>>(istream& is, vector<T>& v){
        for (auto &&x : v) { is >> x; } return is;
    }

    template<class T>
    ostream& operator<<(ostream& os, const vector<T>& v){
        for (auto &&x : v) { os << x << ' '; } cout << endl; return os ;
    }
}
using namespace utils;

class RollingHash{
    static constexpr ll base = 197;
    const vector<ll> pmod{1'000'000'007LL, 1'073'676'287LL,  479'001'599LL};
    string S;
    vector<array<ll, 3>> hash, power;

    void init(){
        auto n = S.size();
        hash.resize(n+1, {0, 0, 0});
        power.resize(n+1, {1, 1, 1});
        for (int i = 0; i < n; ++i) {
            for (int k = 0; k < 3; ++k) {
                hash[i+1][k] = (hash[i][k] * base + S[i]) % pmod[k];
                power[i+1][k] = power[i][k] * base % pmod[k];
            } // end k
        } // end i
    }

public:
    explicit RollingHash(string  c) :S(std::move(c)) { init(); }

    // hash[l, r)
    array<ll, 3> get(int l, int r){
        array<ll,3> res;
        for (int k = 0; k < 3; ++k) {
            res[k] = hash[r][k] - hash[l][k] * power[r - l][k] % pmod[k];
            if(res[k] < 0) res[k] += pmod[k];

        } // end i
        return res;
    }

};

class solver{
    istream& is;
    ostream& os;

public:
    solver(istream& I, ostream& O) :is(I), os(O) {}
    ll N, M;
    void run();
};

int main(int argc, char *argv[]) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(16) << scientific;
#ifdef DEBUG
    string test_cases = "test_roling_hash.txt";
    cerr << test_cases << " -->" << endl;
    auto fs = fstream(test_cases, fstream::in);
    int loop = 0;
    while(fs) {
        loop++;
        cout << '#' << loop << "#------\n";
        solver(fs, cout).run();
    }
    if(loop <= 1) {
        cout << "===" << endl;
        while(cin) solver(cin, cout).run();
    }
#else
    solver(cin, cout).run();
#endif
    return 0;
}

void solver::run(){
    is >> N >> M;
    if(!is) return;
    string s; is >> s;
    set<array<ll,3 >> hash;
    RollingHash rhs(s);

    int l, r; l = 0; r = 1;
    for (int i = 0; i < M; ++i) {
        string q;
        is >> q;
        if(q[0] == 'R'){
            if(q[1] == '+') r++;
            else r--;
        }
        else{
            if(q[1] == '+') l++;
            else l--;
        }
        hash.insert(rhs.get(l, r));
    } // end i
    os << hash.size() << endl;

}



Measured memory_bytes: 36128