#include <iostream>
#include <algorithm>
#include <vector>
#include <string>

constexpr int N = 20;

void solve() {
    std::vector<std::vector<std::string>> ss(N);

    int q;
    std::cin >> q;
    while (q--) {
        int t;
        std::cin >> t;

        if (t == 0) {
            int i;
            std::cin >> i;
            --i;

            int m;
            std::cin >> m;
            while (m--) {
                std::string s;
                std::cin >> s;
                ss[i].push_back(s);
            }

        } else if (t == 1) {
            std::string s;
            std::cin >> s;

            bool removed = false;
            for (int i = 0; i < N; ++i) {
                auto it = std::find(ss[i].begin(), ss[i].end(), s);
                if (it != ss[i].end()) {
                    std::cout << i + 1 << std::endl;
                    ss[i].erase(it);
                    removed = true;
                    break;
                }
            }

            if (!removed) std::cout << -1 << std::endl;

        } else {
            int i;
            std::cin >> i;
            --i;
            ss[i].clear();
        }
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}