#include<bits/stdc++.h>
#define miu 1000007
using namespace std;
const long long inf = 1e18;
int n, m;
long long H;
struct node {
    long long a, b, c;
} tr[miu << 2];
struct Snode {
    int p;  
    node t; 
};
inline node merge(node x, node y) {
    if(x.c <= y.a) {
        return (node){min(x.b + y.a - x.c, inf), min(x.b + y.b - x.c, inf), y.c}; 
    } else if(x.c <= y.b) {
        return (node){x.a, min(x.b + y.b - x.c, inf), y.c};
    } else {
        return (node){x.a, x.b, min(x.c + y.c - y.b, inf)};
    }
}
inline void pushup(int id) {
    tr[id] = merge(tr[id << 1], tr[id << 1 | 1]);
}
void modify(int id, int l, int r, int x, node v) {
    if(l == r) {
        tr[id] = v; return;
    }
    int mid = l + r >> 1;
    if(x <= mid) modify(id << 1, l, mid, x, v);
    else modify(id << 1 | 1, mid + 1, r, x, v);
    pushup(id);
}
Snode query(int id, int l, int r, int x, node cur) {
    if(l == r) {
        if(merge(cur, tr[id]).a >= H) return (Snode){l - 1, cur};
        else return (Snode){l, merge(cur, tr[id])};
    }
    int mid = l + r >> 1;
    if(x > mid) return query(id << 1 | 1, mid + 1, r, x, cur);
    Snode lt = query(id << 1, l, mid, x, cur);
    if(lt.p < mid) return lt;
    if(merge(lt.t, tr[id << 1 | 1]).a >= H) return query(id << 1 | 1, mid + 1, r, x, lt.t);
    return (Snode){r, merge(lt.t, tr[id << 1 | 1])};
}
inline node init(int op, long long x) {
    switch(op) {
        case 1:
            return (node){x, x, 0};
            break;
        case 2:
            return (node){x - 1, inf, x};
            break;
        case 3:
            return (node){0, x, x};
            break;
    }
}
signed main() {
    freopen("bad.in", "r", stdin);
    freopen("bad.out", "w", stdout);
    scanf("%d %d %lld", &n, &m, &H);
    for(int i = 1; i <= n; ++i) {
        int op; long long x; scanf("%d %lld", &op, &x);
        modify(1, 1, n, i, init(op, x));
    }
    for(int i = 1; i <= m; ++i) {
        int tp, op, x;
        long long v; scanf("%d %d", &tp, &x);
        if(tp == 1) {
            scanf("%d %lld", &op, &v);
            modify(1, 1, n, x, init(op, v));
        } else {
            int ans = query(1, 1, n, x, (node){0, 0, 0}).p;
            printf("%d\n", ans < x ? -1 : ans);
        }
    }
    return 0;
}