#include<bits/stdc++.h>
using std::cin, std::cout;
using ll = long long;
int n, m;

const int N = 200005;
struct evt { ll T; int id, stk; };

std::vector<int> ids[N];
bool operator < (const evt & x, const evt & y) {
	return x.T > y.T;
}

std::priority_queue<evt> Q[N];
ll tag[N];

std::vector<int> qs[N];

int tm[N];
int dead[N];
ll goal[N];
int p;
std::vector<int> list;
void check(int id) {
	if(dead[id]) {
		return ;
	}
	ll sum = 0;
	for(int x : qs[id]) {
		sum += tag[x];
	}
	if(sum >= goal[id]) {
		dead[id] = 1;
		list.push_back(id);
	} else {
		ll rem = goal[id] - sum;
		int k = qs[id].size();
		++ tm[id];
		for(int x : qs[id]) {
			Q[x].push({tag[x] + (rem + k - 1) / k, id, tm[id]});
		}
	}
}

int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n >> m;
	int last = 0;
	for(int i = 1;i <= m;++i) {
		int op, y, k, x;
		cin >> op;
		if(op == 1) {
			cin >> y >> k, y ^= last;
			std::vector<int> q(k);
			goal[++p] = y;
			tm[p] = 1;

			for(int & x : q) {
				cin >> x, x ^= last;
				goal[p] += tag[x];
				Q[x].push({tag[x] + (y + k - 1) / k, p, 1});
			}
			qs[p] = q;

		} else {
			list = {};
			cin >> x >> y;
			x ^= last;
			y ^= last;
			tag[x] += y;
			for(;Q[x].size() && Q[x].top().T <= tag[x];) {
				auto [T, id, t] = Q[x].top(); Q[x].pop();
				if(t != tm[id]) continue;
				check(id);
			}
			last = list.size();
			cout << list.size();
			sort(list.begin(), list.end());
			for(int x : list) cout << ' ' << x;
			cout << '\n';
		}
	}
}