#include<bits/stdc++.h>
using i64 = long long;
using pii = std::array<int, 3>;
void solve() {
	int n, m;
	std::cin >> n >> m;

	std::vector<std::priority_queue<pii, std::vector<pii>, std::greater<pii> > > obs(n + 1);
	std::vector<int> ok(m + 1), tag(n + 1), over(m + 1);
	std::vector<std::vector<int> > mp(m + 1), rev(m + 1);

	int last = 0, idx = 0;
	while (m --) {
		int op;
		std::cin >> op;
		if (op & 1) {
			int y, k;
			std::cin >> y >> k;
			y ^= last;
			++ idx;
			ok[idx] = y;
			mp[idx].resize(k);
			rev[idx].resize(k);
			int need = (ok[idx] + k - 1) / k;		
			for (int i = 0; i < k; i ++) {
				int u;
				std::cin >> u;
				u ^= last;
				mp[idx][i] = u;
				rev[idx][i] = tag[u] + need;
				obs[u].push({tag[u] + need, idx, i});
			}
		} else {
			int x, y;
			std::cin >> x >> y;
			x ^= last;
			y ^= last;
			tag[x] += y;
			std::vector<int> ans;
			while (obs[x].size() && obs[x].top()[0] <= tag[x]) {
				auto it = obs[x].top();
				obs[x].pop();
				int id = it[1];
				if (over[id] || it[0] != rev[id][it[2]]) {
					continue;
				}
				int all = 0;
				int k = mp[id].size();
				int lastneed = (ok[id] + k - 1) / k;
				for (int i = 0; i < k; i ++) {
					int u = mp[id][i];
					all += tag[u] - (rev[id][i] - lastneed);
				}
				if (all >= ok[id]) {
					ans.push_back(id);
					over[id] = 1;
					continue;
				}
				ok[id] -= all;
				int need = (ok[id] + k - 1) / k;
				for (int i = 0; i < k; i ++) {
					int u = mp[id][i];
					rev[id][i] = tag[u] + need;
					obs[u].push({tag[u] + need, id, i});
				}
			}	
			last = ans.size();
			std::sort(ans.begin(), ans.end());
			std::cout << last;
			for (auto it : ans) {
				std::cout << ' ' << it;
			}
			std::cout << '\n';
		}
	}
}
signed main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t = 1;
	//std::cin >> t;
	while (t --) {
		solve();
	}
	return 0;
}