//蒟蒻一枚 rp++
//即得易见平凡，仿照上例显然。留作习题答案略，读者自证不难
//反之亦然同理，推论自然成立，略去过程Q.E.D.，由上可知证毕
#include<bits/stdc++.h>
//#pragma GCC optimize("Ofast")
#define re register
#define il inline
#define gc() getchar()
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define repp(i,a,b) for(int i=(a);i<(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define tep(i,x) for(int i=head[x];~i;i=ne[i])
#define ls(x) x<<1
#define rs(x) x<<1|1
#define eps (1e-9)
#define inf 0x3f3f3f3f
#define INF 1e16
#define pii pair<int,int>
#define mp(i,j) make_pair(i,j)
#define pb push_back
#define fi first
#define sc second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef double db;
namespace IO{
//	#define gc()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<9,stdin),p1==p2)?EOF:*p1++)
//	char buf[1<<9],*p1=buf,*p2=buf;
	template<typename T> inline void read(T &x){
		bool f=1;x=0;char ch=gc();
		while(ch<'0'||ch>'9'){if(ch=='-')f=0;ch=gc();}
		while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch&15),ch=gc();
		x=f?x:-x;
	}
	template<typename T> inline void write(T x){
		if(x<0) putchar('-'),x=-x;
	   	if(x>9) write(x/10);
	   	putchar(char('0'+x%10));
	}
	template <typename T,typename ...Args> inline
	void read(T &x,Args &...args){read(x);read(args...);}
	template<typename T> inline void write(T x,char c){write(x),putchar(c);}
}
using namespace IO;
namespace MOD{
	typedef uint32_t u32;
	typedef uint64_t u64;
	typedef __uint128_t u128;
	u64 p,m;
	void set_mod(u32 mod){
		m=mod,p=-m/m+1;
	}
	u64 mo(u64 x){//取模优化
		x-=u64((u128)x*p>>64)*m;
		return (x>=m)?x-m:x;
	}
}
bool _ST;
const int N=2e6+100,B=200;
int n,m,k,v[N],w[N],x[N];
int opt[N],val[N];
int ans[N],f[N],g[N];
bool vis[N];
bool _ED;
signed main(){
	fprintf(stderr,"%.20lf MB\n",(&_ST-&_ED)/1048576.0);
	//ios::sync_with_stdio(false);
	//cin.tie(0);cout.tie(0);
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	read(n,m,k);
	memset(v,-inf,sizeof v);
	rep(i,1,n){
		read(x[i]);
		read(v[x[i]]),w[x[i]]=v[x[i]]*x[i],vis[x[i]]=1;
	}
	rep(i,1,m){
		read(opt[i],val[i]);
		if(opt[i]==1) vis[x[val[i]]]=0;
	}
	per(i,k,B+1){
		if(vis[i]){
			per(j,k/i,v[i]) g[j]=max(g[j],g[j-v[i]]+w[i]);
		}
	}
	rep(i,1,B){
		if(vis[i]){
			per(j,k,w[i]) f[j]=max(f[j],f[j-w[i]]+v[i]);
		}
	}
	per(i,m,1){
		if(opt[i]==1){
			int pos=x[val[i]];
			if(pos<=B){
				per(j,k,w[pos]) f[j]=max(f[j],f[j-w[pos]]+v[pos]);
			}
			else{
				per(j,k/B,v[pos]) g[j]=max(g[j],g[j-v[pos]]+w[pos]);
			}
		}
		else{
			int res=0;
			rep(j,0,k/B) if(g[j]<=val[i])res=max(res,f[val[i]-g[j]]+j);
			ans[i]=res;
		}
	}
	rep(i,1,m) if(opt[i]==2) write(ans[i],'\n');
	fprintf(stderr,"%.4lf s\n",1.0*clock()/CLOCKS_PER_SEC);
	return 0;
}
//谨记:
//十年OI一场空，不开longlong见祖宗
//数据千万条，清空第一条。多测不清空，爆零两行泪。清空不规范，TLE总相伴。
//快读要加类型名