#define READ_NUM_TEST_CASES  false
#define USE_FAST_IO          false

////////////////////////////////////////////////////////////////////////////////
// AMALGAMATE: "include/template.hpp" BEGINS HERE
//
	
	
	#include <bits/stdc++.h>
	using namespace std;
	
	
	////////////////////////////////////////////////////////////////////////////////
	// AMALGAMATE: "include/abbrevs.hpp" BEGINS HERE
	//
		
		#define UI unsigned int
		
		#define LL long long
		#define ULL unsigned long long
		
		#define PII pair<int,int>
		
		
		#define RI ri()
		#define RUI rui()
		
		#define RLL rll()
		#define RULL rull()
		
		#define RSTR rstr()
		
		
		
		#define FO(i,a,b) for(int i=(a); i<int(b); ++i)
		#define OF(i,a,b) for(int i=(b)-1; i>=int(a); --i)
		
		#define FOR(i,n) FO(i,0,n)
		#define ROF(i,n) OF(i,0,n)
		
		
		#define MIN(a,b) ((a)<(b) ? (a) : (b))
		#define MAX(a,b) ((b)<(a) ? (a) : (b))
		
		#define REMIN(a,b) ((a) = min(a,b))
		#define REMAX(a,b) ((a) = max(a,b))
		
		#define ALL(c) (c).begin(),(c).end()
		
		#define SQR(x) ((x)*(x))
		
		
		
		bool is_pow(int x) {
			return (x&(x-1)) == 0;
		}
		
	
	//
	// AMALGAMATE: "include/abbrevs.hpp" ENDS HERE
	////////////////////////////////////////////////////////////////////////////////
	
	
	#if USE_FAST_IO
		
		////////////////////////////////////////////////////////////////////////////////
		// AMALGAMATE: "include/fast-io.hpp" BEGINS HERE
		//
			
			
			//#define FREAD  fread
			//#define FWRITE fwrite
			
			#define FREAD  fread_unlocked
			#define FWRITE fwrite_unlocked
			
			
			
			
			
			
			struct Buffer {
				FILE* const stream;
				const int buffer_size;
			
				uint8_t* const buff;
				int pos = 0;
			
				Buffer(FILE* a_stream, int a_buffer_size) :
						stream( a_stream ),
						buffer_size( a_buffer_size ),
						buff( new uint8_t[ buffer_size ] ) {
					setvbuf(stream, NULL, _IONBF, 0);
				}
			
				~Buffer() {
					delete[] buff;
				}
			};
			
			
			
			
			
			
			
			
			
			
			class In_Buffer : private Buffer {
			public:
				In_Buffer(FILE* a_stream, int a_buffer_size) : Buffer(a_stream, a_buffer_size) {
					FREAD(buff, 1, buffer_size, stream);
				}
			
			public:
				void prepare(int num_chars) {
					auto remaining = buffer_size - pos;
					if(remaining >= num_chars) return;
			
					assert(remaining >= 0); // prevent compiler warning
					memcpy(buff, buff+pos, remaining);
			
					int read = FREAD(buff+remaining, 1, pos, stream);
					int block_end = remaining + read;
					memset(buff + block_end, 0, buffer_size - block_end);
					pos = 0;
				}
			
			public:
				char get_unchecked() {
					return buff[ pos++ ];
				}
			};
			
			
			template<class INT>
			INT read_unsigned(In_Buffer& buff) {
				buff.prepare(25);
			
				char c = buff.get_unchecked();
				while(c < '-') c = buff.get_unchecked();
			
				INT r = 0;
			
				for(;;) {
					if(c < '0') return r;
					c -= '0';
					r = r*10 + c;
					c = buff.get_unchecked();
				}
			}
			
			
			template<class INT>
			INT read_signed(In_Buffer& buff) {
				buff.prepare(25);
			
				char c = buff.get_unchecked();
				while(c < '-') c = buff.get_unchecked();
			
				bool minus = false;
				if(c=='-') {
					c = buff.get_unchecked();
					minus = true;
				}
			
				INT r = 0;
			
				for(;;)
				{
					if(c < '0') return minus ? -r : r;
					r = r*10 + (c-'0');
					c = buff.get_unchecked();
				}
			}
			
			
			
			
			In_Buffer& operator>>( In_Buffer& buff, char& c) {
				buff.prepare(1);
				c = buff.get_unchecked();
				return buff;
			}
			
			
			
			In_Buffer& operator>>( In_Buffer& buff, UI& r) { r = read_unsigned<UI>(buff); return buff; }
			In_Buffer& operator>>( In_Buffer& buff, ULL& r) { r = read_unsigned<ULL>(buff); return buff; }
			
			In_Buffer& operator>>( In_Buffer& buff, int& r) { r = read_signed<int>(buff); return buff; }
			In_Buffer& operator>>( In_Buffer& buff, LL& r) { r = read_signed<LL>(buff); return buff; }
			
			In_Buffer& operator>>( In_Buffer& buff, string& r) {
				r.clear();
			
				char c = buff.get_unchecked();
				while(c <= ' ') c = buff.get_unchecked();
			
				do {
					r.push_back( c );
					c = buff.get_unchecked();
				} while(c > ' ');
			
				return buff;
			}
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			class Out_Buffer : private Buffer {
			public:
				Out_Buffer(FILE* a_stream, int a_buffer_size) : Buffer(a_stream, a_buffer_size) {}
			
				~Out_Buffer() {
					flush();
				}
			
			public:
				void prepare(int num_chars) {
					if(buffer_size - pos >= num_chars) return;
					flush();
				}
			
				void flush() {
					FWRITE(buff, 1, pos, stream);
					pos = 0;
				}
			
			public:
				void put_unchecked(const char& c) {
					buff[ pos++ ] = c;
				}
			
				void put_unchecked(const char* str, int len) {
					memcpy(buff+pos, str, len);
					pos += len;
				}
			};
			
			
			
			
			
			
			template<class INT>
			void write_signed(Out_Buffer& buff, const INT& i) {
				buff.prepare(25);
			
				if(i == 0) {
					buff.put_unchecked('0');
					return;
				}
			
				auto ci = i;
			
				if(ci < 0) {
					buff.put_unchecked('-');
					ci = -ci;
				}
			
				const int sz = 25;
				char temp[sz];
				int pos = sz;
			
				while(ci) {
					temp[ --pos ] = '0' + ci%10;
					ci/=10;
				}
			
				buff.put_unchecked(temp+pos, sz-pos);
			}
			
			
			
			template<class INT>
			void write_unsigned(Out_Buffer& buff, const INT& i) {
				buff.prepare(25);
			
				if(i==0) {
					buff.put_unchecked('0');
					return;
				}
			
				const int sz = 25;
				char temp[sz];
				int pos = sz;
			
				auto ci = i;
			
				while(ci) {
					temp[ --pos ] = '0' + ci%10;
					ci/=10;
				}
			
				buff.put_unchecked(temp+pos, sz-pos);
			}
			
			
			
			Out_Buffer& operator<<( Out_Buffer& buff, const char& c) {
				buff.prepare(1);
				buff.put_unchecked( c );
				return buff;
			}
			
			Out_Buffer& operator<<( Out_Buffer& buff, const UI& r) { write_unsigned<UI>(buff, r); return buff; }
			Out_Buffer& operator<<( Out_Buffer& buff, const ULL& r) { write_unsigned<ULL>(buff, r); return buff; }
			
			Out_Buffer& operator<<( Out_Buffer& buff, const int& r) { write_signed<int>(buff, r); return buff; }
			Out_Buffer& operator<<( Out_Buffer& buff, const LL& r) { write_signed<LL>(buff, r); return buff; }
			
			Out_Buffer& operator<<( Out_Buffer& buff, const char* cstr) { auto len = strlen(cstr); buff.prepare(len); buff.put_unchecked(cstr, len); return buff; }
			Out_Buffer& operator<<( Out_Buffer& buff, const string& str) { buff.prepare( str.size() ); buff.put_unchecked(str.data(), str.size()); return buff; }
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			
			#define BUFF_SIZE 32768
			In_Buffer  fast_cin(  stdin,  BUFF_SIZE );
			Out_Buffer fast_cout( stdout, BUFF_SIZE );
			//Out_Buffer fast_cerr( stderr, BUFF_SIZE );
			
			char fast_endl = '\n';
			
		
		//
		// AMALGAMATE: "include/fast-io.hpp" ENDS HERE
		////////////////////////////////////////////////////////////////////////////////
		
		#define cin fast_cin
		#define cout fast_cout
		#define endl fast_endl
	#else
		
		////////////////////////////////////////////////////////////////////////////////
		// AMALGAMATE: "include/slow-io.hpp" BEGINS HERE
		//
			
			struct Slow_IO_Singleton {
				Slow_IO_Singleton() {
					ios_base::sync_with_stdio( false );
			
					std::cin.tie( nullptr );
					std::cout.tie( nullptr );
			
					setlocale(LC_ALL,"C");
			
					const int buffer_size = 32768;
			
					static char stdin_buffer[ buffer_size ];
					static char stdout_buffer[ buffer_size ];
			
					cin.rdbuf()->pubsetbuf( stdin_buffer, buffer_size );
					cout.rdbuf()->pubsetbuf( stdout_buffer, buffer_size );
				}
			
				~Slow_IO_Singleton() {
			
				}
			};
			
			
			Slow_IO_Singleton slow_io_singleton;
			
		
		//
		// AMALGAMATE: "include/slow-io.hpp" ENDS HERE
		////////////////////////////////////////////////////////////////////////////////
		
		#ifndef DEBUG
			#define endl '\n'
		#endif
	#endif
	
	
	////////////////////////////////////////////////////////////////////////////////
	// AMALGAMATE: "include/abbrevs-io.hpp" BEGINS HERE
	//
		
		
		
		
		int ri()   { int r; cin >> r; return r; }
		UI  rui()  { UI r; cin >> r; return r; }
		
		LL  rll()  { LL r;  cin >> r; return r; }
		ULL rull() { ULL r; cin >> r; return r; }
		
		string rstr() {string s; cin >> s; return s; }
		
	
	//
	// AMALGAMATE: "include/abbrevs-io.hpp" ENDS HERE
	////////////////////////////////////////////////////////////////////////////////
	
	
	
	////////////////////////////////////////////////////////////////////////////////
	// AMALGAMATE: "include/debug.hpp" BEGINS HERE
	//
		
		
		#define ASS(x) assert(x)
	
	//
	// AMALGAMATE: "include/debug.hpp" ENDS HERE
	////////////////////////////////////////////////////////////////////////////////
	
	
	
	
	//
	// for salgo
	#define CONTEST_MODE
	
	namespace salgo {};
	using namespace salgo;
	//

//
// AMALGAMATE: "include/template.hpp" ENDS HERE
////////////////////////////////////////////////////////////////////////////////


//
// snippets/fenwick.hpp
//
template<class T>
class Fenwick {
	vector<T> _v;
	static auto _ls_one(int s) { return s & (-s); }

public:
	Fenwick(int n) : _v(n+1) {}

	// sum range [0..b)
	T sum(int b) {
		T r = 0;
		for (; b; b -= _ls_one(b)) r += _v[b];
		return r;
	}

	// sum range [a..b)
	T sum(int a, int b) { if(a >= b) return 0; return sum(b) - sum(a); } //todo: decide what happens when a>=b

	// fw[k] += v
	void update(int k, T mod) {
		k += 1;
		for (; k <= (int)_v.size()-1; k += _ls_one(k)) _v[k] += mod;
	}
};


struct Test_Case {

	void solve() {
		// cout << "Case #" << icase+1 << ": ";

		struct Q {
			int type;
			LL weight;
			LL want_weight;

			int weight_idx = 0;
		};

		vector<Q> qs(RI);

		for(auto& q : qs) {
			q.type = 2;
			q.weight = RLL;
		}

		// add real queries
		{
			int num = RI;
			FOR(i, num) {
				Q q;
				q.type = RI;
				q.weight = RLL;
				if(q.type == 1) {
					q.want_weight = RLL;
				}

				qs.push_back(q);
			}
		}

		map<int, int> where_added;

		struct Weight_Info {
			vector<int> all_add_queries;
			vector<int> active_add_queries;
		};

		map<LL, Weight_Info> all_weights;

		FOR(iq, qs.size()) {
			auto& q = qs[iq];

			if(q.type == 2) {
				auto& w = all_weights[q.weight];
				w.all_add_queries.push_back(iq);
				w.active_add_queries.push_back(iq);
			}
			else if(q.type == 3) {
				auto& w = all_weights[q.weight];

				auto add_query_idx = w.active_add_queries.back();
				w.active_add_queries.pop_back();

				where_added[iq] = add_query_idx;
			}
		}

		map<LL, int> first_idx;

		int n = 0;
		for(auto& kv : all_weights) {
			auto& w = kv.second;

			first_idx[kv.first] = n;

			for(auto& iq : w.all_add_queries) {
				qs[iq].weight_idx = n++;
			}
		}

		FOR(iq, qs.size()) {
			auto& q = qs[iq];

			if(q.type == 3) {
				q.weight_idx = qs[ where_added[iq] ].weight_idx;
			}
		}

		auto weights = Fenwick<LL>(n+5);
		auto nums    = Fenwick<int>(n+5);

		auto curr_fish = multiset<LL>();

		for(auto& q : qs) {
			if(q.type == 2) {
				weights.update(q.weight_idx, q.weight);
				nums   .update(q.weight_idx, 1);
				curr_fish.insert(q.weight);
				continue;
			}

			if(q.type == 3) {
				weights.update(q.weight_idx, -q.weight);
				nums   .update(q.weight_idx, -1);
				curr_fish.erase( curr_fish.find(q.weight) );
				continue;
			}

			// q.type == 1



			// static int ith_query = 0;
			// ++ith_query;
			// if(ith_query == 156) {
			// 	cout << "curr_fish " << curr_fish.size() << endl;
			// 	for(auto& f : curr_fish) cout << f << " ";
			// 	cout << endl;
			// }



			struct Range {
				int fr, to;
			};

			vector<Range> ranges;
			ranges.push_back({0,0});

			auto get_first_idx = [&](LL weight) {
				auto iter = curr_fish.lower_bound(weight);
				if(iter == curr_fish.end()) return pair{n, LLONG_MAX};
				else return pair{first_idx[*iter], *iter};
			};


			LL now_want_weight = 0;

			auto bs = [&](int fr, int _to) {
				int to = _to;
				while(fr+1 < to) {
					int mid = (fr+to) / 2;

					auto sum = weights.sum(mid, _to);

					if(q.weight + sum >= now_want_weight) {
						fr = mid;
					}
					else {
						to = mid;
					}
				}
				return fr;
			};

			int result = 0;

			while(q.weight < q.want_weight) {
				auto [start_idx, start_weight] = get_first_idx(q.weight);
				// if(ith_query == 156) cout << "want fish " << start_weight << endl;

				now_want_weight = MIN(q.want_weight, start_weight+1);

				// if(ith_query == 156) cout << "now_want_weight: " << now_want_weight << endl;

				auto new_range = Range{start_idx, start_idx};
				if(ranges.back().to == new_range.fr) {
					new_range = ranges.back();
					ranges.pop_back();

					if(new_range.fr == 0) break;
				}
				auto eat_start_idx = bs(ranges.back().to, new_range.fr);

				auto sum = weights.sum(eat_start_idx, new_range.fr);

				// if(ith_query == 156) cout << "eat " << sum << " from range [" << eat_start_idx << ", " << new_range.fr << ")" << endl;

				q.weight += sum;
				result += nums.sum(eat_start_idx, new_range.fr);

				new_range.fr = eat_start_idx;
				if(new_range.fr == ranges.back().to) {
					new_range.fr = ranges.back().fr;
					ranges.pop_back();
				}

				// if(ith_query == 156) cout << "push range [" << new_range.fr << ", " << new_range.to << ")" << endl;

				ranges.push_back( new_range );
			}

			if(q.weight >= q.want_weight) {
				cout << result << endl;
			}
			else {
				cout << -1 << endl;
			}
		}
	}

	int icase = -1;
}; // struct Test_Case



int main() {
	int num_cases = READ_NUM_TEST_CASES ? RI : 1;
	
	FOR(i, num_cases) {
		Test_Case tc;
		tc.icase = i;
		tc.solve();
	}

	return 0;
}