#include <bits/stdc++.h>
using namespace std;

const int max_s = 10;

struct Queue {
    array<vector<deque<int>>, 2> pos;
    vector<bool> removed;
    int curr_id;

    Queue() : pos({vector<deque<int>>(max_s + 1), vector<deque<int>>(max_s + 1)}), curr_id(0) {}

    void add(int s, int w) {
        pos[w][s].emplace_back(curr_id++);
        removed.push_back(false);
    }

    void remove(int id) {
        removed[id - 1] = true;
    }

    optional<pair<int, int>> pop_first(int64_t &b) {
        pair<int, int> s_min0 = {1e9, 1e9};
        for (int s = 1; s <= min(int64_t(max_s), b); ++s) {
            while (pos[0][s].size() && removed[pos[0][s].front()]) {
                pos[0][s].pop_front();
            }
            if (pos[0][s].size()) {
                s_min0 = min(s_min0, {pos[0][s].front(), s});
            }
        }

        pair<int, int> s_min1 = {1e9, 1e9};
        for (int s = 1; s <= max_s; ++s) {
            while (pos[1][s].size() && removed[pos[1][s].front()]) {
                pos[1][s].pop_front();
            }
            if (pos[1][s].size()) {
                s_min1 = min(s_min1, {pos[1][s].front(), s});
            }
        }

        if (s_min0.first < s_min1.first) {
            if (s_min0.first == 1e9) { return nullopt; }
            auto [id, s] = s_min0;
            pos[0][s].pop_front();
            b -= s;
            return s_min0;
        }
        else {
            if (s_min1.first == 1e9) { return nullopt; }
            auto &[id, s] = s_min1;
            pos[1][s].pop_front();
            if (s > b) {
                pos[1][s - b].push_front(id);
                s = b;
            }
            b -= s;
            return s_min1;
        }        
        return nullopt;
    }
};

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

    int q;
    cin >> q;
    
    Queue Q;
    while (q--) {
        int type;
        cin >> type;
        if (type == 1) {
            int s, w;
            cin >> s >> w;
            Q.add(s, w);
        }
        else if (type == 2) {
            int id;
            cin >> id;
            Q.remove(id);
        }
        else {
            int64_t b;
            cin >> b;
            vector<pair<int, int>> res;

            while (b > 0) {
                auto e = Q.pop_first(b);
                if (!e) { break; }
                res.push_back(e.value());
            }

            cout << res.size() << '\n';
            for (auto [id, s] : res) {
                cout << id + 1 << ' ' << s << '\n';
            }
        }
    }
    return 0;
}