//这回只花了114514min就打完了。
//真好。记得多手造几组。
#include <bits/stdc++.h>
//#define int long long
#define pai 3.141592653589793238462643383279502884197169399375105820
#define MOD 1000000007
#define eps 0.00000001
inline int min(int a,int b) {return a<b?a:b;}
inline int max(int a,int b) {return a>b?a:b;}
#define ULL unsigned long long
#define LL long long
#define INF 0x3f3f3f3f
#define INF_LL 0x3f3f3f3f3f3f3f3f
static char buf[1000000],*paa=buf,*pd=buf;
static char buf2[1000000],*pp=buf2;
#define getchar() paa==pd&&(pd=(paa=buf)+fread(buf,1,1000000,stdin),paa==pd)?EOF:*paa++
inline void pc(char ch){
	if(pp-buf2==1000000) fwrite(buf2,1,1000000,stdout),pp=buf2;
	*pp++=ch;
}
inline void pcc(){
	fwrite(buf2,1,pp-buf2,stdout);
	pp=buf2;
}
inline int read(void) {
	int w=1;
	register int x(0);register char c(getchar());
	while(c<'0'||c>'9') {if(c=='-') w=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return w*x;
}
void write(int x) {
	if(x<0) pc('-'),x=-x;
	static int sta[20];
	int top=0;
	do {
		sta[top++]=x%10,x/=10;
	} while(x);
	while(top) pc(sta[--top]+48);
}
void we(int x) {
	write(x);
	pc('\n');
}
inline bool cmp_xi(int a,int b) {return a<b;}
inline bool cmp_da(int a,int b) {return a>b;}
#define MOD 1000000009
int N,M,rt,nc,su[2000009],k,laz[2000009],ls[2000009],rs[2000009];
inline int pw(int a,int b) {
	int as=1;
	while(b) {
		if(b&1) as=1ll*as*a%MOD;
		a=1ll*a*a%MOD;
		b>>=1;
	}
	return as;
}
inline int ni(int a) {
	return pw(a,MOD-2);
}
#define md ((l+r)>>1)
void up(int& n,int l,int r,int L,int R,int v) {
	if(!n) n=++k;
	assert(k<=2000000);
	if(L<=l&&r<=R) {
		v=1ll*v*pw(nc,l-L)%MOD;
		laz[n]=v;
		su[n]=1ll*v*(pw(nc,r-l+1)-1)%MOD*ni(nc-1)%MOD;
		return; 
	}
	if(laz[n]!=-1) {
		if(!ls[n]) ls[n]=++k;
		if(!rs[n]) rs[n]=++k;assert(k<=2000000);
		laz[ls[n]]=laz[rs[n]]=laz[n];
		su[ls[n]]=1ll*laz[n]*(pw(nc,md-l+1)-1)%MOD*ni(nc-1)%MOD;
		su[rs[n]]=(su[n]-su[ls[n]]+MOD)%MOD;
		laz[n]=-1; 
	}
	if(md>=L) {
		up(ls[n],l,md,L,R,v);
	}
	if(R>md) {
		up(rs[n],md+1,r,L,R,v);
	}
	su[n]=(su[ls[n]]+su[rs[n]])%MOD;
}
int q(int n,int l,int r,int L,int R) {
	if(!n) return 0;
	if(L<=l&&r<=R) {
		return su[n];
	}
	if(laz[n]!=-1) {
		int x=std::max(l,L)-l,y=std::min(r,R)-l;
		return 1ll*pw(nc,x)*laz[n]%MOD*(pw(nc,y-x+1)-1)%MOD*ni(nc-1)%MOD; 
	}
	int as=0;
	if(md>=L) as=(as+q(ls[n],l,md,L,R))%MOD;
	if(R>md) as=(as+q(rs[n],md+1,r,L,R))%MOD;
	return as;
}
signed main(void) {
    //freopen("m.in","r",stdin);
    //freopen("m.out","w",stdout);
    memset(laz,-1,sizeof(laz));
    N=read();M=read();
    nc=2ll*ni(5)%MOD;
    int la=0;
    while(M--) {
    	int t=read();
    	if(t==1) {
    		int l=read()^la,r=read()^la,t=read(),p=read();
    		t=1ll*t*pw(nc,p)%MOD;
    		up(rt,1,N,l,r,t);
		} else {
			int l=read()^la,r=read()^la;
			la=q(rt,1,N,l,r);
			printf("%d\n",la);
		}
	}
    return 0; 
}