#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define met(a, b) memset(a, b, sizeof(a))
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define bep(i, a, b) for(int i = a; i >= b; i--)
#define lowbit(x) (x&(-x))
#define MID ((l + r) / 2)
#define ls (pos<<1)
#define rs ((pos<<1)+1)
#define pb push_back
#define ios() ios::sync_with_stdio(0)

using namespace std;

const int maxn = 1e5 + 1010;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 123456789;
const double eps = 1e-4;

struct NODE {
    int op, l, w, r;
}arr[maxn];
struct node {
    int l, r, w;
    bool operator < (const node &a) const {
        return a.r < r;
    }
};

int root[maxn*12];
int b[maxn], tail;
priority_queue<node> que;

// void root_init(int pos, int l, int r) {
//     root[pos] = 0;
//     if(l == r) return;
//     root_init(ls, l, MID);
//     root_init(rs, MID + 1, r);
// }
void update(int pos, int l, int r, int k, int val) {
    if(l == r) {
        root[pos] += val;
        return;
    }
    if(k <= MID) update(ls, l, MID, k, val);
    else update(rs, MID + 1, r, k, val);
    root[pos] = root[ls] + root[rs];
}
int query(int pos, int l, int r, int k) {
    // cout << root[pos] << ‘ ‘ << k << ‘ ‘ << l << ‘ ‘ << r << endl;
    if(k > root[pos]) return -1;
    if(l == r) return l;
    if(root[ls] >= k) return query(ls, l, MID, k);
    else return query(rs, MID + 1, r, k - root[ls]);
}

int main() {
    int T, k = 0;
    scanf("%d", &T);
    while(T--) {
        tail = 0;
        int n;
        // que = priority_queue<node>();
        scanf("%d", &n);
        rep(i, 1, n) {
            scanf("%d", &arr[i].op);
            if(arr[i].op == 1) scanf("%d%d%d", &arr[i].l, &arr[i].w, &arr[i].r);
            else scanf("%d%d", &arr[i].l, &arr[i].r);
            if(arr[i].op == 1) b[++tail] = arr[i].w;
        }
        sort(b + 1, b + 1 + tail);
        tail = unique(b + 1, b + 1 + tail) - b - 1;
        // rep(i, 1, tail) cout << b[i] << ‘ ‘;
        // cout << endl;
        // root_init(1, 1, tail);
        printf("Case %d:\n", ++k);
        rep(i, 1, n) {
            if(arr[i].op == 1) {
                int pos = lower_bound(b + 1, b + 1 + tail, arr[i].w) - b;
                que.push((node){arr[i].l, arr[i].r, arr[i].w});
                update(1, 1, tail, pos, 1);
            }
            else {
                while(!que.empty()) {
                    node t = que.top();
                    if(t.r >= arr[i].l) break;
                    que.pop();
                    // cout << t.w << ‘ ‘;
                    int pos = lower_bound(b + 1, b + 1 + tail, t.w) - b;
                    update(1, 1, tail, pos, -1);
                }
                // cout << arr[i].r << ‘ ‘ ;
                int pos = query(1, 1, tail, arr[i].r);
                if(pos == -1) printf("-1\n");
                else printf("%d\n", b[pos]);
            }
        }
        while(!que.empty()) {
            node t = que.top();
            que.pop();
            int pos = lower_bound(b + 1, b + 1 + tail, t.w) - b;
            update(1, 1, tail, pos, -1);
        }
    }
    return 0;
}