#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=1e5+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,tim[N];
vector<int> fac[N];
ll tag[N];// 减了多少.
struct item{
	ll val;
	int pos,tim;
	item(ll _val=0,int _pos=0,int _tim=0)
		:val(_val),pos(_pos),tim(_tim)
	{}
	inline bool operator>(const item &b)const{
		return val>b.val;
	} 
};
priority_queue<item,vector<item>,greater<item> > pq[N];
struct Node{
	int k,vec[10];
	ll lim,now[10];
	inline void input(){
		read(lim);
		k=SZ(fac[lim]);
		for(int i=1;i<=k;++i) vec[i]=fac[lim][i-1];
		read(lim);
		lim^=lst;
	}
	inline ll calc(){
		ll ans=0;
		for(int i=1;i<=k;++i) ans+=now[i]-tag[vec[i]];
		return ans;
	}
}node[N];
inline void upd(int x,ll y,vector<int> &ans){
	tag[x]+=y;
	while(SZ(pq[x])&&pq[x].top().val-tag[x]<=0){
		int u=pq[x].top().pos;
		if(pq[x].top().tim!=tim[u]){
			pq[x].pop();
			continue;
		}
		ll cur=node[u].calc();
		if(cur<=0){
			ans.eb(u);
			tim[u]++;
		}else{
			tim[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];
				pq[id].push(item(node[u].now[i],u,tim[u]));
			}
		}
	}
}	
signed main(){
	read(n,m);
	for(int i=2;i<=n;++i){
		if(!SZ(fac[i])){ 
			for(int j=i;j<=n;j+=i) fac[j].eb(i);
		}
	}
	vector<int> zero;
	int tot=0;
	for(ll opt,x,y;m;--m){
		read(opt);
		if(opt==1){
			node[++tot].input();
			if(!node[tot].lim){
				zero.eb(tot);
				continue;
			}
			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];
				pq[id].push(item(node[tot].now[i],tot,0));
			}
		}else{
			read(x,y);
			y^=lst;
			vector<int> ans;
			for(int v:fac[x]) upd(v,y,ans);
			for(int v:zero) ans.eb(v);
			zero.clear();
			sort(all(ans));
			lst=SZ(ans);
			print(lst);
			for(int v:ans) pt(' '),print(v);
			printf("\n");
		}
	}
	return 0;
}