#include<bits/stdc++.h>
using i64 = long long;
using pii = std::array<int, 2>;
using piii = std::array<int, 3>;

inline char getc() {
    static char buf[100000] , *p1 = buf , *p2 = buf;
    return p1 == p2 && (p2 = (p1 = buf) + fread(buf , 1 , 100000 , stdin) , p1 == p2) ? EOF : *p1++;
}
 
inline int read() {
    char c = getc() ; int ret = 0;
    while (!isdigit(c)) c = getc();
    while (+isdigit(c)) (ret *= 10) += c - 48 , c = getc();
    return ret;
}

void solve() {
	int n, m;
	//std::cin >> n >> m;
	n = read();
	m = read();
	int last = 0, idx = 0;

	std::vector<int> ok(m + 1), tag(n + 1), ans;
	std::vector<std::set<pii> > obs(n + 1);
	std::vector<std::vector<pii> > p(m + 1);

	std::vector<piii> del, ins;

	auto put = [&](int id) -> void {
		int need = (ok[id] + p[id].size() - 1) / p[id].size();
		for (auto &it : p[id]) {
			it[1] = tag[it[0]];
			//obs[it[0]].insert({});
			ins.push_back({it[0], it[1] + need, id});
		}
	};
	auto check = [&](int id) -> void {
		int need = (ok[id] + p[id].size() - 1) / p[id].size();
		for (auto it : p[id]) {
			ok[id] -= tag[it[0]] - it[1];
			//obs[it[0]].erase({});
			del.push_back({it[0], it[1] + need, id});
		}
		if (ok[id] <= 0) {
			ans.push_back(id);
		} else {
			put(id);
		}
	};
	auto add = [&](int id, int val) -> void {
		del.clear();
		ins.clear();
		tag[id] += val;
		while (obs[id].size() && (*obs[id].begin())[0] <= tag[id]) {
			check((*obs[id].begin())[1]);
			obs[id].erase(obs[id].begin());
		}

		for (auto it : del) {
			obs[it[0]].erase({it[1], it[2]});
		}
		for (auto it : ins) {
			obs[it[0]].insert({it[1], it[2]});
		}
	};
	while (m --) {
		int op;
		//std::cin >> op;
		op = read();
		if (op & 1) {
			int y, k;
			//std::cin >> y >> k;
			y = read();
			k = read();
			y ^= last;
			idx ++;
			ok[idx] = y;
			for (int i = 0; i < k; i ++) {
				int u;
				//std::cin >> u;
				u = read();
				u ^= last;
				p[idx].push_back({u, 0});
			}
			ins.clear();
			put(idx);
			for (auto it : ins) {
				obs[it[0]].insert({it[1], it[2]});
			}
		} else {
			int x, y;
			//std::cin >> x >> y;
			x = read();
			y = read();
			x ^= last;
			y ^= last;
			ans.clear();
			add(x, y);
			last = ans.size();
			std::sort(ans.begin(), ans.end());
			/*std::cout << last;
			for (auto it : ans) {
				std::cout << ' ' << it;
			}
			std::cout << '\n';*/

			printf("%d", last);
			for (auto it : ans) {
				printf(" %d", it);
			}
			printf("\n");
		}
	}
}
signed main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t = 1;
	//std::cin >> t;
	while (t --) {
		solve();
	}
	return 0;
}