#include <bits/stdc++.h>
using namespace std;
template <typename T>
void out(T x) {
  cout << x << endl;
  exit(0);
}
const int maxn = 1e6 + 5;
int n, m, k;
string s;
const int N = 10;
struct segtree {
  vector<int> lazy, lastright, firstleft;
  vector<vector<vector<int>>> t;
  int n;
  segtree() {}
  void init(int n) {
    this->n = n;
    lazy.resize(4 * n, -1);
    lastright.resize(4 * n);
    firstleft.resize(4 * n);
    t.resize(4 * n);
    for (int i = 0; i < 4 * n; i++) {
      t[i] = vector<vector<int>>(N, vector<int>(N, 0));
    }
  }
  void combine(int v, int tl, int tr) {
    assert(tl >= 1 && tr <= n);
    lastright[v] = lastright[2 * v + 1];
    firstleft[v] = firstleft[2 * v];
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        t[v][i][j] = t[2 * v][i][j] + t[2 * v + 1][i][j];
      }
    }
    t[v][lastright[2 * v]][firstleft[2 * v + 1]]++;
  }
  void build(int v, int tl, int tr) {
    lazy[v] = -1;
    if (tl == tr) {
      lastright[v] = firstleft[v] = (s[tl] - 'a');
    } else {
      int tm = (tl + tr) / 2;
      build(2 * v, tl, tm);
      build(2 * v + 1, tm + 1, tr);
      combine(v, tl, tr);
    }
  }
  void push(int v, int tl, int tr) {
    if (lazy[v] == -1) return;
    int tm = (tl + tr) / 2;
    lastright[2 * v] = firstleft[2 * v] = lazy[v];
    lastright[2 * v + 1] = firstleft[2 * v + 1] = lazy[v];
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        t[2 * v][i][j] = t[2 * v + 1][i][j] = 0;
      }
    }
    t[2 * v][lazy[v]][lazy[v]] = tm - tl;
    t[2 * v + 1][lazy[v]][lazy[v]] = tr - tm - 1;
    lazy[2 * v] = lazy[v];
    lazy[2 * v + 1] = lazy[v];
    lazy[v] = -1;
  }
  void update(int v, int tl, int tr, int l, int r, int val) {
    if (l > tr || r < tl) return;
    if (l <= tl && tr <= r) {
      for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
          t[v][i][j] = 0;
        }
      }
      lastright[v] = firstleft[v] = val;
      t[v][val][val] = tr - tl;
      lazy[v] = val;
    } else {
      int tm = (tl + tr) / 2;
      push(v, tl, tr);
      update(2 * v, tl, tm, l, r, val);
      update(2 * v + 1, tm + 1, tr, l, r, val);
      combine(v, tl, tr);
    }
  }
  void get(int v, int tl, int tr, int l, int r) {
    if (l > tr || r < tl) return;
    if (l <= tl && tr <= r) {
    } else {
      int tm = (tl + tr) / 2;
      push(v, tl, tr);
      get(2 * v, tl, tm, l, r);
      get(2 * v + 1, tm + 1, tr, l, r);
      combine(v, tl, tr);
    }
  }
  void print() {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        cout << t[1][i][j] << " ";
      }
      cout << endl;
    }
    cout << endl;
  }
};
segtree t;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> k;
  cin >> s;
  s = "*" + s;
  t.init(n);
  t.build(1, 1, n);
  while (m--) {
    int typ;
    cin >> typ;
    if (typ == 1) {
      int l, r;
      char c;
      cin >> l >> r >> c;
      t.update(1, 1, n, l, r, c - 'a');
    } else {
      string p;
      cin >> p;
      int len = p.size();
      vector<int> mp(N, -1);
      for (int i = 0; i < len; i++) {
        mp[p[i] - 'a'] = i;
      }
      int ans = 1;
      for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
          if (mp[j] <= mp[i]) {
            ans += t.t[1][i][j];
          }
        }
      }
      cout << ans << "\n";
    }
  }
  return 0;
}
