#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

inline int rd() {
	int x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

#define fr     first
#define sc     second
#define mp     make_pair
#define mt     make_tuple
#define pb     push_back
#define pii    pair<int, int>
#define tii    tuple<int, int, int>
#define all(s) (s).begin(), (s).end()

#define N 200007

set<pii> s[N];

vector<pii> a[N];

vector<int> ans, pos;

ll need[N], val[N];

inline void reset(int id) {
	pos.clear();
	for (auto [w, p] : a[id]) {s[p].erase(mp(w, id)); pos.pb(p);}
	a[id].clear(); 

	ll nw = 0;
	for (auto p : pos) nw += val[p];
	if (nw >= need[id]) {ans.pb(id); return;}
	ll w = max(1ull, (need[id] - nw) / pos.size());
	for (auto p : pos) {
		s[p].insert(mp(val[p] + w, id));
		a[id].pb(mp(val[p] + w, p));
	}
}	

int main() {
	int n = rd(), m = rd();
	int id = 0, lst = 0;
	for (int i = 1; i <= m; ++i) {
		int op = rd();
		if (op == 1) {
			need[++id] = rd() ^ lst;
			int k = rd();
			ll w = max(1ll, need[id] / k);
			for (int p; k; --k) {
				need[id] += val[p = rd() ^ lst];
				s[p].insert(mp(val[p] + w, id));
				a[id].pb(mp(val[p] + w, p));
			}
		} else {
			int x = rd() ^ lst;
			val[x] += rd() ^ lst; ans.clear();
			while (!s[x].empty() && val[x] >= s[x].begin() -> fr) reset(s[x].begin() -> sc);
			printf("%d", lst = ans.size());
			sort(all(ans));
			for (auto i : ans) printf(" %d", i);
			puts("");
		}
	}
	return 0;
}