#include <bits/stdc++.h>
using namespace std;
#define rep(i, f, t) for (int i(f); i <= t; ++i)
#define re(i, t) for (int i(1); i <= t; ++i)
#define per(i, t, f) for (int i(t); i >= f; --i)
#define pe(i, t) for (int i(t); i >= 1; --i)
#define each(i, x) for (auto &i : (x))
#define nx(i, u) for (int i(head[u]); i; i = e[i].nxt)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<double, int> pdi;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int>> pipii;
typedef pair<string, bool> psb;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define mkp make_pair
#define ix(l, r) ((l + r) | (l != r))
#define lowbit(x) (x & -x)
#define inf (2e9)
#define INF (2e18)
#define dinf 1000000000000.0
#define eps 1e-10
#define FileIn(x) freopen(x, "r", stdin)
#define FileOut(x) freopen(x, "w", stdout)
#define FileIO(x, y) \
    FileIn(x);       \
    FileOut(y)
#define SYSP system("pause")
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define CIOO                     \
    ios::sync_with_stdio(false); \
    cin.tie(0);                  \
    cout.tie(0)
#define range(x) x.begin(), x.end()
template <class T>
void read(T &x)
{
    bool sign = false;
    x = 0;
    char c = getchar();
    while (!isdigit(c))
    {
        if (c == '-')
            sign = true;
        c = getchar();
    }
    while (isdigit(c))
    {
        x = x * 10 + (c - '0');
        c = getchar();
    }
    sign ? x = -x : x;
}
template <class T, class... Args>
void read(T &x, Args &...args) { read(x), read(args...); }
template <class T>
void write(T x)
{
    if (x < 0)
        x = -x, putchar('-');
    if (x > 9)
        write(x / 10);
    putchar(x % 10 + 48);
}
template <class T>
void write(T x, char c)
{
    write(x);
    putchar(c);
}
template <class T, class... Args>
void write(T x, char c, Args... args) { write(x, c), write(args...); }
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
// #define ls(x) t[x].son[0]
// #define rs(x) t[x].son[1]
// #define int long long
// #pragma GCC optimize(1)
// #pragma GCC optimize(2)
// #pragma GCC optimize(3,"Ofast")
const int N = 2e6 + 5;
int n, m, K;
int x[N], v[N];
int op[N], opa[N];
int del[N];
int f[N], g[N];
int Up;
void add(int i)
{
    int t = v[i] * x[i];
    Up = max(Up, K / x[i]);
    per(j, Up, v[i]) f[j] = min(f[j], f[j - v[i]] + t);
    pe(j, Up) g[j] = min(g[j + 1], f[j]);
}
int Ans[N];
const int B = 14;
pii buc[N];
struct Dat
{
    int T, W, sta;
} all[N];
int tot;
int Del;
int main()
{
    // FileIO("ex_miner1.in", "myA.out");
    CIOO;
    cin >> n >> m >> K;
    re(i, n) cin >> x[i] >> v[i];
    re(i, m)
    {
        cin >> op[i] >> opa[i];
        if (op[i] == 1)
        {
            del[opa[i]] = 1;
            if (opa[i] <= B)
                Del |= (1 << (opa[i] - 1));
        }
    }
    re(i, K) f[i] = g[i] = 1e9;
    pe(i, n)
    {
        if (!del[i] && i > B)
            add(i);
    }
    rep(s, 0, (1 << B) - 1)
    {
        int T = 0, W = 0;
        re(i, B)
        {
            if (s >> (i - 1) & 1)
            {
                T += x[i] * v[i];
                W += v[i];
            }
        }
        all[++tot] = (Dat){T, W, s};
    }
    auto cmp = [](Dat x, Dat y)
    {
        if (x.T == y.T)
            return x.W < y.W;
        return x.T < y.T;
    };
    sort(all + 1, all + tot + 1, cmp);
    pe(id, m)
    {
        if (op[id] == 1)
        {
            del[opa[id]] = 0;
            if (opa[id] > B)
                add(opa[id]);
            else
                Del ^= (1 << (opa[id] - 1));
        }
        else
        {
            int tp = 0;
            re(i, tot)
            {
                if ((all[i].sta & Del) == 0)
                    buc[++tp] = mkp(all[i].T, all[i].W);
            }
            int p = 0, now = 0, ans = 0;
            per(i, Up, 0)
            {
                while (p < tp && buc[p + 1].fi + g[i] <= opa[id])
                    p++, now = max(now, buc[p].se);
                if (buc[p].fi + g[i] <= opa[id])
                    ans = max(ans, i + now);
            }
            Ans[id] = ans;
        }
    }
    re(i, m)
    {
        if (op[i] == 2)
            cout << Ans[i] << '\n';
    }
    return 0;
}