#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define gt getchar
#define pt putchar
#define fst first
#define scd second
#define SZ(s) ((int)s.size())
#define all(s) s.begin(),s.end()
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef double db;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int uint;
const int N=2e5+5;
using namespace std;
using namespace __gnu_pbds;
typedef pair<ll,int> pii;
template<class T,class I> inline bool chkmax(T &a,I b){return b>a?a=b,1:0;}
template<class T,class I> inline bool chkmin(T &a,I b){return b<a?a=b,1:0;}
inline bool __(char ch){return ch>=48&&ch<=57;}
template<class T> inline void read(T &x){
	x=0;bool sgn=0;static char ch=gt();
	while(!__(ch)&&ch!=EOF) sgn|=(ch=='-'),ch=gt();
	while(__(ch)) x=(x<<1)+(x<<3)+(ch&15),ch=gt();
	if(sgn) x=-x;
}
template<class T,class ...I> inline void read(T &x,I &...x1){
	read(x);
	read(x1...);
}
template<class T> inline void print(T x){
	static char stk[70];short top=0;
	if(x<0) pt('-');
	do{stk[++top]=x>=0?(x%10+48):(-(x%10)+48),x/=10;}while(x);
	while(top) pt(stk[top--]);
}
template<class T> inline void printsp(T x){
	print(x);
	putchar(' ');
}
template<class T> inline void println(T x){
	print(x);
	putchar('\n');
}
int n,m,lst;
ll tag[N];// 减了多少.
struct Set{
	priority_queue<pii,vector<pii>,greater<pii> > pq1,pq2;
	inline void ins(pii x){pq1.push(x);}
	inline void del(pii x){pq2.push(x);}
	inline void adj(){while(SZ(pq2)&&pq1.top()==pq2.top()) pq1.pop(),pq2.pop();}
	inline int size(){return SZ(pq1)-SZ(pq2);}
	inline pii top(){adj();return pq1.top();} 
}st[N];
struct Node{
	int lim,k,vec[10];
	ll now[10];
	inline void input(){
		read(lim);
		lim^=lst;
		read(k);
		for(int i=1;i<=k;++i) read(vec[i]),vec[i]^=lst;
	}
	inline ll calc(){
		ll ans=0;
		for(int i=1;i<=k;++i) ans+=now[i]-tag[vec[i]];
		return ans;
	}
}node[N];
signed main(){
	read(n,m);
	int tot=0;
	for(int opt,x,y;m;--m){
		read(opt);
		if(opt==1){
			node[++tot].input();
			for(int i=1;i<=node[tot].k;++i){
				node[tot].now[i]=(node[tot].lim/node[tot].k);
			}
			for(int i=1;i<=node[tot].lim%node[tot].k;++i) node[tot].now[i]++;
			for(int i=1;i<=node[tot].k;++i){
				int id=node[tot].vec[i];
				node[tot].now[i]+=tag[id];
				st[id].ins(pii(node[tot].now[i],tot));
			}
		}else{
			read(x,y);
			x^=lst,y^=lst;
			tag[x]+=y;
			vector<int> ans;
			while(SZ(st[x])&&st[x].top().fst-tag[x]<=0){
				int u=st[x].top().scd,cur=node[u].calc();
				if(cur<=0){
					ans.eb(u);
					for(int i=1;i<=node[u].k;++i){
						int id=node[u].vec[i];
						st[id].del(pii(node[u].now[i],u));
					}
				}else{
					for(int i=1;i<=node[u].k;++i){
						int id=node[u].vec[i];
						st[id].del(pii(node[u].now[i],u));
					}
					for(int i=1;i<=node[u].k;++i) node[u].now[i]=cur/node[u].k;
					cur%=node[u].k;
					for(int i=1;i<=node[u].k&&cur;++i){
						if(node[u].vec[i]==x){
							node[u].now[i]++;
							cur--;
							break;
						}	
					}
					for(int i=1;i<=node[u].k&&cur;++i){
						if(node[u].vec[i]!=x){
							node[u].now[i]++;
							cur--;
						}
					}
					for(int i=1;i<=node[u].k;++i){
						int id=node[u].vec[i];
						node[u].now[i]+=tag[id];
						st[id].ins(pii(node[u].now[i],u));
					}
				}
			}
			sort(all(ans));
			lst=SZ(ans);
			print(lst);
			for(int v:ans) pt(' '),print(v);
			printf("\n");
		}
	}
	return 0;
}