#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, k, q; cin >> n >> k >> q;
    vector<string> v;
    while(q--){
        int t; cin >> t;
        if(t == 1){
            string s; cin >> s;
            v.push_back(s);
        }else{
            vector<string> p(6);
            vector<int> d(6);
            for(int i = 0; i < 6; i++) cin >> p[i] >> d[i];
            int sum = 0;
            int ans = -1;
            for(int i = 0; i < 6; i++){
                int l = max(0, (int)v.size()-n);
                bool ok = false;
                for(int j = l; j < v.size(); j++){
                    if(p[i] == v[j]) ok = true;
                }
                if(ok){
                    sum += min(k, d[i]);
                }else{
                    sum += d[i];
                }
                if(sum > 60){
                    ans = i;
                    break;
                }
                if(i == 5) ans = 6;
            }
            cout << ans << endl;
            for(int i = 0; i < ans; i++) v.push_back(p[i]);
        }
    }
}