#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2000005, B = 80, b = 6000, INF = 0x3f3f3f3f;
int n, m, k, x[N], v[N], f[N], g[N], op[N], q[N], cnt[N], ans[N];
bool is[N];
inline int max(int x, int y) {
  return x > y ? x : y;
}
inline int min(int x, int y) {
  return x < y ? x : y;
}
void add(int p) {
  if (x[p] <= B)
    for (int i = k; i >= x[p] * v[p]; i--)
      f[i] = max(f[i - x[p] * v[p]] + v[p], f[i]);
  else
    for (int i = k / x[p]; i >= v[p]; i--)
      g[i] = min(g[i - v[p]] + x[p] * v[p], g[i]);
}
signed main() {
cin.tie(nullptr)->sync_with_stdio(false);

  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) {
    cin >> x[i] >> v[i];
  }
  for (int i = 1; i <= k / B; i++) {
    g[i] = INF;
  }
  for (int i = 1; i <= m; i++) {
    cin >> op[i] >> q[i];
    if (op[i] == 1) {
      is[q[i]] = 1;
    }
  }
  for (int i = 1; i <= n; i++)
    if (!is[i] && x[i] > b) {
      if (cnt[v[i]] * v[i] >= k / b) {
        is[i] = 1;
      } else {
        cnt[v[i]]++;
      }
    }
  for (int i = 1; i <= n; i++) {
    if (!is[i]) {
      add(i);
    }
  }
  for (int i = m; i; i--) {
    if (op[i] == 1) {
      add(q[i]);
    } else {
      for (int j = k / B; ~j; j--) {
        if (g[j] <= q[i]) {
          ans[i] = max(j + f[q[i] - g[j]], ans[i]);
        }
      }
    }
  }
  for (int i = 1; i <= m; i++) {
    if (op[i] == 2) {
      printf("%lld\n", ans[i]);
    }
  }
  return 0;
}