pub mod scanner {

    pub struct Scanner {
        buf: Vec<String>,
    }

    impl Scanner {
        pub fn new() -> Self {
            Self { buf: vec![] }
        }

        pub fn new_from(source: &str) -> Self {
            let source = String::from(source);
            let buf = Self::split(source);
            Self { buf }
        }

        pub fn next<T: std::str::FromStr>(&mut self) -> T {
            loop {
                if let Some(x) = self.buf.pop() {
                    return x.parse().ok().expect("");
                }
                let mut source = String::new();
                std::io::stdin().read_line(&mut source).expect("");
                self.buf = Self::split(source);
            }
        }

        fn split(source: String) -> Vec<String> {
            source
                .split_whitespace()
                .rev()
                .map(String::from)
                .collect::<Vec<_>>()
        }
    }
}

use crate::scanner::Scanner;
use std::io::Write;
fn main() {
    let mut scanner = Scanner::new();
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    let t: usize = 1;
    for _ in 0..t {
        solve(&mut scanner, &mut out);
    }
}
fn solve(scanner: &mut Scanner, out: &mut std::io::BufWriter<std::io::StdoutLock>) {
    let n: usize = scanner.next();
    let k: usize = scanner.next();
    let q: usize = scanner.next();
    let mut a = vec![];
    for _ in 0..q {
        let t: usize = scanner.next();
        if t == 1 {
            let s: String = scanner.next();
            a.push(s);
        }
        if t == 2 {
            let td = (0..6)
                .map(|_| (scanner.next::<String>(), scanner.next::<usize>()))
                .collect::<Vec<_>>();
            let mut rem = 60;
            let mut now = 0;
            while now < 6 {
                let mut found = false;
                let l = if a.len() > n { a.len() - n } else { 0 };
                for i in l..a.len() {
                    found |= a[i] == td[now].0;
                }
                let x = if found { k.min(td[now].1) } else { td[now].1 };
                if x <= rem {
                    rem -= x;
                    now += 1;
                } else {
                    break;
                }
            }
            for i in 0..now {
                a.push(td[i].0.clone());
            }
            writeln!(out, "{}", now).unwrap();
        }
    }
}