using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, k, q) = (c[0], c[1], c[2]);
        var que = new Queue<string>();
        var dic = new Dictionary<string, int>();
        var ans = new List<int>();
        for (var i = 0; i < q; ++i)
        {
            var r = NN;
            if (r == 1)
            {
                var s = ReadLine();
                que.Enqueue(s);
                if (dic.ContainsKey(s)) ++dic[s];
                else dic[s] = 1;
            }
            else
            {
                var time = 0;
                var que2 = new Queue<string>();
                for (var j = 0; j < 6; ++j)
                {
                    var s = ReadLine().Split();
                    var (t, d) = (s[0], int.Parse(s[1]));
                    if (dic.ContainsKey(t) && dic[t] > 0) d = Math.Min(d, k);
                    time += d;
                    if (time <= 60)
                    {
                        que2.Enqueue(t);
                    }
                }
                ans.Add(que2.Count);
                while (que2.Count > 0)
                {
                    var u = que2.Dequeue();
                    que.Enqueue(u);
                    if (dic.ContainsKey(u)) ++dic[u];
                    else dic[u] = 1;
                }
            }
            while (que.Count > n) --dic[que.Dequeue()];
        }
        WriteLine(string.Join("\n", ans));
    }
}