#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN=1e6+5;
ll lim[MAXN],up[MAXN],sum[MAXN];
vector <int> pos[MAXN];
set <array<ll,2>> f[MAXN];
signed main() {
	int n,m=0,q,lst=0;
	scanf("%d%d",&n,&q);
	while(q--) {
		int op;
		scanf("%d",&op);
		if(op==1) {
			int k,c;
			scanf("%d%d",&k,&c),k^=lst;
			lim[++m]=k,pos[m].resize(c);
			for(int &i:pos[m]) scanf("%d",&i),i^=lst,lim[m]+=sum[i];
			up[m]=(lim[m]+c-1)/c;
			for(int i:pos[m]) f[i].insert({up[m],m});
		} else {
			int u,w;
			scanf("%d%d",&u,&w),u^=lst,w^=lst;
			sum[u]+=w;
			vector <int> cur,ans;
			for(auto x=f[u].begin(),it=f[u].lower_bound({sum[u]+1,0});x!=it;++x) cur.push_back((*x)[1]);
			for(int i:cur) {
				ll rem=lim[i];
				for(int j:pos[i]) rem-=sum[j],f[j].erase({up[i],i});
				if(rem<=0) ans.push_back(i);
				else {
					up[i]=(rem-1)/pos[i].size()+1;
					for(int j:pos[i]) f[j].insert({up[i],i});
				}
			}
			sort(ans.begin(),ans.end()),printf("%d",lst=ans.size());
			for(int x:ans) printf(" %d",x); puts("");
		}
	}
	return 0;
}