#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


// Each operation consists of disjoint pairs (compare and swap).
// Batcher's algorithm
// (1 + 2 + ... + ceil(log_2(n))) operations
vector<vector<pair<int, int>>> parallelSort(int n) {
  assert(n >= 0);
  vector<vector<pair<int, int>>> ops;
  for (int m = 1; m < n; m <<= 1) {
    // sorted blocks of m elements
    for (int d = m; d >= 1; d >>= 1) {
      // operate on pairs of distance d
      ops.emplace_back();
      for (int i = 0; i < n; i += (m << 1)) {
        for (int j = i + d % m; j + d < i + (m << 1); j += (d << 1)) {
          for (int k = j; k < j + d && k + d < n; ++k) {
            ops.back().emplace_back(k, k + d);
          }
        }
      }
    }
  }
  return ops;
}


// point add, rectangle sum
template <class X, class Y, class T> struct Bit2d {
  vector<X> xs;
  vector<pair<Y, X>> yxs;
  vector<vector<Y>> yss;
  int m;
  vector<int> ns;
  vector<vector<T>> bit;
  Bit2d() {}
  void book(X x, Y y) {
    xs.push_back(x);
    yxs.emplace_back(y, x);
  }
  void build() {
    sort(xs.begin(), xs.end());
    xs.erase(unique(xs.begin(), xs.end()), xs.end());
    m = xs.size();
    yss.assign(m, {});
    sort(yxs.begin(), yxs.end());
    for (const auto &yx : yxs) {
      const X x = yx.second;
      const Y y = yx.first;
      const int a = lower_bound(xs.begin(), xs.end(), x) - xs.begin();
      assert(a < m); assert(xs[a] == x);
      for (int u = a; u < m; u |= u + 1) yss[u].push_back(y);
    }
    ns.assign(m, 0);
    bit.assign(m, {});
    for (int u = 0; u < m; ++u) {
      yss[u].erase(unique(yss[u].begin(), yss[u].end()), yss[u].end());
      ns[u] = yss[u].size();
      bit[u].assign(ns[u], 0);
    }
  }
  void add(X x, Y y, T val) {
    const int a = lower_bound(xs.begin(), xs.end(), x) - xs.begin();
    assert(a < m); assert(xs[a] == x);
    for (int u = a; u < m; u |= u + 1) {
      const int b = lower_bound(yss[u].begin(), yss[u].end(), y) - yss[u].begin();
      assert(b < ns[u]); assert(yss[u][b] == y);
      for (int v = b; v < ns[u]; v |= v + 1) bit[u][v] += val;
    }
  }
  T get(X x0, X x1, Y y0, Y y1) const {
    const int a0 = lower_bound(xs.begin(), xs.end(), x0) - xs.begin();
    const int a1 = lower_bound(xs.begin(), xs.end(), x1) - xs.begin();
    T ret = 0;
    for (int u = a0; u; u &= u - 1) ret -= get(u - 1, y0, y1);
    for (int u = a1; u; u &= u - 1) ret += get(u - 1, y0, y1);
    return ret;
  }
 private:
  T get(int u, Y y0, Y y1) const {
    T ret = 0;
    const int b0 = lower_bound(yss[u].begin(), yss[u].end(), y0) - yss[u].begin();
    const int b1 = lower_bound(yss[u].begin(), yss[u].end(), y1) - yss[u].begin();
    for (int v = b0; v; v &= v - 1) ret -= bit[u][v - 1];
    for (int v = b1; v; v &= v - 1) ret += bit[u][v - 1];
    return ret;
  }
};


////////////////////////////////////////////////////////////////////////////////
// SA-IS
//   String: string, vector<int>, vector<long long>
//   if sigma <= n,  O(n) time, O(n) space
//   if sigma >  n,  O(n log n) time, O(n) space
template <class String> vector<int> suffixArrayRec(const String &as) {
  const int n = as.size();
  if (n == 0) return {};
  const auto minmaxA = minmax_element(as.begin(), as.end());
  const auto minA = *minmaxA.first, maxA = *minmaxA.second;
  if (static_cast<unsigned long long>(maxA) - minA >=
      static_cast<unsigned long long>(n)) {
    vector<int> us(n);
    for (int u = 0; u < n; ++u) us[u] = u;
    std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
      return (as[u] < as[v]);
    });
    int b = 0;
    vector<int> bs(n, 0);
    for (int i = 1; i < n; ++i) {
      if (as[us[i - 1]] != as[us[i]]) ++b;
      bs[us[i]] = b;
    }
    return suffixArrayRec(bs);
  }
  const int sigma = maxA - minA + 1;
  vector<int> pt(sigma + 1, 0), poss(sigma);
  for (int u = 0; u < n; ++u) ++pt[as[u] - minA + 1];
  for (int a = 0; a < sigma; ++a) pt[a + 1] += pt[a];
  // cmp[u] := (as[u, n) < as[u + 1, n))
  vector<bool> cmp(n);
  cmp[n - 1] = false;
  for (int u = n - 1; --u >= 0; ) {
    cmp[u] = (as[u] != as[u + 1]) ? (as[u] < as[u + 1]) : cmp[u + 1];
  }
  // ><,  nn - id (0 <= id < n)
  int nn = 0;
  vector<int> ids(n, 0);
  int last = n;
  vector<int> nxt(n, 0);
  // put ><, from the tail of each bucket
  vector<int> us(n, 0);
  memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
  for (int u = n - 1; --u >= 1; ) if (!cmp[u - 1] && cmp[u]) {
    ids[u] = ++nn;
    nxt[u] = last;
    last = u;
    us[--poss[as[u] - minA]] = u;
  }
  // follow > backwards, from the head of each bucket
  memcpy(poss.data(), pt.data(), sigma * sizeof(int));
  us[poss[as[n - 1] - minA]++] = n - 1;
  for (int i = 0; i < n; ++i) {
    const int u = us[i];
    if (u && !cmp[u - 1]) us[poss[as[u - 1] - minA]++] = u - 1;
  }
  // follow < backwards, from the tail of each bucket
  memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
  for (int i = n; --i >= 0; ) {
    const int u = us[i];
    if (u && cmp[u - 1]) us[--poss[as[u - 1] - minA]] = u - 1;
  }
  if (nn) {
    int vsLen = 0;
    vector<int> vs(nn);
    for (const int u : us) if (ids[u]) vs[vsLen++] = u;
    int b = 0;
    vector<int> bs(nn, 0);
    for (int j = 1; j < nn; ++j) {
      // as[v1, w1] (< or =) as[v0, w0]
      int v1 = vs[j - 1], v0 = vs[j];
      const int w1 = nxt[v1], w0 = nxt[v0];
      if (w1 - v1 != w0 - v0) {
        ++b;
      } else {
        for (; ; ++v1, ++v0) {
          if (v1 == n) { ++b; break; }
          if (as[v1] != as[v0]) { ++b; break; }
          if (v1 == w1) break;
        }
      }
      bs[nn - ids[vs[j]]] = b;
    }
    for (int u = 0; u < n; ++u) if (ids[u]) vs[nn - ids[u]] = u;
    const auto sub = suffixArrayRec(bs);
    // put ><, from the tail of each bucket
    memset(us.data(), 0, n * sizeof(int));
    memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
    for (int j = nn; --j >= 0; ) {
      const int u = vs[sub[j]];
      us[--poss[as[u] - minA]] = u;
    }
    // follow > backwards, from the head of each bucket
    memcpy(poss.data(), pt.data(), sigma * sizeof(int));
    us[poss[as[n - 1] - minA]++] = n - 1;
    for (int i = 0; i < n; ++i) {
      const int u = us[i];
      if (u && !cmp[u - 1]) us[poss[as[u - 1] - minA]++] = u - 1;
    }
    // follow < backwards, from the tail of each bucket
    memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
    for (int i = n; --i >= 0; ) {
      const int u = us[i];
      if (u && cmp[u - 1]) us[--poss[as[u - 1] - minA]] = u - 1;
    }
  }
  return us;
}

// us[i]: i-th suffix
// su[u]: index of as[u, n)
// hs[i]: longest common prefix of as[us[i - 1], n) and as[us[i], n)
struct SuffixArray {
  int n;
  bool rmq;
  vector<int> us, su, hs;
  SuffixArray() : n(0), rmq(false) {}
  SuffixArray(const string &as, bool rmq_) : rmq(rmq_) { build(as); }
  SuffixArray(const vector<int> &as, bool rmq_) : rmq(rmq_) { build(as); }
  SuffixArray(const vector<long long> &as, bool rmq_) : rmq(rmq_) { build(as); }
  template <class String> void build(const String &as) {
    n = as.size();
    us = suffixArrayRec(as);
    su.resize(n + 1);
    for (int i = 0; i < n; ++i) su[us[i]] = i;
    su[n] = -1;
    hs.assign(n, 0);
    for (int h = 0, u = 0; u < n; ++u) if (su[u]) {
      for (int v = us[su[u] - 1]; v + h < n && as[v + h] == as[u + h]; ++h) {}
      hs[su[u]] = h;
      if (h) --h;
    }
    if (rmq) {
      const int logN = n ? (31 - __builtin_clz(n)) : 0;
      hs.resize((logN + 1) * n - (1 << logN) + 1);
      for (int e = 0; e < logN; ++e) {
        int *hes = hs.data() + e * n;
        for (int i = 0; i <= n - (1 << (e + 1)); ++i) {
          hes[n + i] = min(hes[i], hes[i + (1 << e)]);
        }
      }
    }
  }
  // Returns longest common prefix of as[u, n) and as[v, n).
  //   0 <= u, v <= n
  //   Assumes rmq.
  inline int lcp(int u, int v) const {
    if (u == v) return n - u;
    int i = su[u], j = su[v];
    if (i > j) swap(i, j);
    const int e = 31 - __builtin_clz(j - i);
    return min(hs[e * n + i + 1], hs[e * n + j + 1 - (1 << e)]);
  }
  
  // !
  int cmp(const vector<pair<int, int>> &as, const vector<pair<int, int>> &bs) const {
    const int asLen = as.size(), bsLen = bs.size();
    int i = 0, j = 0;
    pair<int, int> a(0, 0), b(0, 0);
    for (; ; ) {
      for (; i < asLen && a.first == a.second; ++i) a = as[i];
      for (; j < bsLen && b.first == b.second; ++j) b = bs[j];
      if (a.first == a.second) {
        if (b.first == b.second) {
          return 0;
        } else {
          return -1;
        }
      } else {
        if (b.first == b.second) {
          return +1;
        } else {
          const int m = min(a.second - a.first, b.second - b.first);
          const int l = lcp(a.first, b.first);
          if (l < m) {
            return (su[a.first + l] < su[b.first + l]) ? -1 : +1;
          } else {
            a.first += m;
            b.first += m;
          }
        }
      }
    }
  }
};
////////////////////////////////////////////////////////////////////////////////


using VP = vector<pair<int, int>>;
void readVP(VP &vp) {
  int len;
  scanf("%d", &len);
  vp.resize(len);
  for (int i = 0; i < len; ++i) {
    scanf("%d%d", &vp[i].first, &vp[i].second);
    --vp[i].first;
  }
}

int N, Q;
char S[100'010];
vector<char> O;
vector<VP> A, B;
vector<int> T;

vector<int> L[2], R[2];

void rev(VP &vp) {
  reverse(vp.begin(), vp.end());
  for (auto &lr : vp) {
    lr = make_pair(N - lr.second, N - lr.first);
  }
}

int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    scanf("%s", S);
    O.resize(Q);
    A.assign(Q, {});
    B.assign(Q, {});
    T.assign(Q, -1);
    for (int q = 0; q < Q; ++q) {
      scanf(" %c", &O[q]);
      if (false) {
      } else if (O[q] == '+') {
        readVP(A[q]);
      } else if (O[q] == '-') {
        scanf("%d", &T[q]);
        --T[q];
      } else if (O[q] == '?') {
        readVP(A[q]);
        readVP(B[q]);
      } else {
        assert(false);
      }
    }
    
    // sort by 0: prefix, 1: suffix
    for (int dir = 0; dir < 2; ++dir) {
      string cat = S;
      if (dir) {
        reverse(cat.begin(), cat.end());
      }
      cat += '~';
      const SuffixArray sa(cat, true);
      vector<pair<VP, int>> ps;
      for (int q = 0; q < Q; ++q) {
        if (O[q] == '+') {
          ps.emplace_back(A[q], q);
          if (dir) rev(ps.back().first);
        }
        if (O[q] == '?') {
          VP vp = dir ? B[q] : A[q];
          if (dir) rev(vp);
          ps.emplace_back(vp, -Q + q);
          vp.emplace_back(N, N + 1);
          ps.emplace_back(vp, +Q + q);
        }
      }
// for(auto&p:ps){for(auto&lr:p.first)cerr<<cat.substr(lr.first,lr.second-lr.first);cerr<<" "<<p.second<<endl;}cerr<<endl;
      /*
      sort(ps.begin(), ps.end(), [&](const pair<VP, int> &p0, const pair<VP, int> &p1) -> bool {
        const int res = sa.cmp(p0.first, p1.first);
        return (res ? (res < 0) : (p0.second < p1.second));
      });
      */
      const auto para = parallelSort(ps.size());
      for (const auto &ops : para) for (const auto &op : ops) {
        auto &p0 = ps[op.first];
        auto &p1 = ps[op.second];
        const int res = sa.cmp(p0.first, p1.first);
        if (res ? (res > 0) : (p0.second > p1.second)) {
          swap(p0, p1);
        }
      }
// for(auto&p:ps){for(auto&lr:p.first)cerr<<cat.substr(lr.first,lr.second-lr.first);cerr<<" "<<p.second<<endl;}cerr<<endl;
      L[dir].assign(Q, -1);
      R[dir].assign(Q, -1);
      for (int x = 0; x < (int)ps.size(); ++x) {
        if (ps[x].second < 0) {
          const int q = ps[x].second + Q;
          L[dir][q] = x;
        } else if (ps[x].second < Q) {
          const int q = ps[x].second;
          L[dir][q] = x;
        } else {
          const int q = ps[x].second - Q;
          R[dir][q] = x;
        }
      }
    }
    
    Bit2d<int, int, int> bit;
    for (int q = 0; q < Q; ++q) {
      if (O[q] == '+') {
        bit.book(L[0][q], L[1][q]);
      }
    }
    bit.build();
    for (int q = 0; q < Q; ++q) {
      if (false) {
      } else if (O[q] == '+') {
        bit.add(L[0][q], L[1][q], +1);
      } else if (O[q] == '-') {
        bit.add(L[0][T[q]], L[1][T[q]], -1);
      } else if (O[q] == '?') {
        const int ans = bit.get(L[0][q], R[0][q], L[1][q], R[1][q]);
        printf("%d\n", ans);
      } else {
        assert(false);
      }
    }
  }
  return 0;
}