#include<bits/stdc++.h>
using namespace std;
int main()
{
	int h = 0;
	long long n, q;
	cin >> n >> q;
	string S;
	cin >> S;
	multiset<string> strSet;
	vector<string>A(q + 1, "");
	for (int i = 1; i <= q; i++)
	{
		char c;
		cin >> c;
		if (c == '+')
		{			
			h++;
			string d="";
			int k;
			cin >> k;
			for (int j = 1; j <= k; j++)
			{
				int a, b;
				cin >> a >> b;
				d += S.substr(a - 1, b - a + 1);
			}
			strSet.insert(d);
			A[h] = d;
		}
		else if (c == '-')
		{		
			long long t;
			cin >> t;
			string targetStr = A[t];
			strSet.erase(strSet.find(targetStr));
			h++;
		}
		else if (c == '?')
		{
			h++;
			long long k;
			cin >> k;
			string f="";
			for (int j = 1; j <= k; j++)
			{
				int a, b;
				cin >> a >> b;
				f += S.substr(a - 1, b - a + 1);
			}
			long long m;
			cin >> m;
			string e="";
			for (int j = 1; j <= m; j++)
			{
				int a, b;
				cin >> a >> b;
				e += S.substr(a - 1, b - a + 1);
			}
			long long p = 0;
			for (auto curStr : strSet) 
			{
				if (curStr.find(f) == 0 && curStr.rfind(e) == curStr.length() - e.length()) 
				{
					p++;
				}
			}
			cout << p << endl;
		}
	}
	return 0;
}