import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.NoSuchElementException; class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next());} } class Seg { final int MOD=(int)(1e9+7); int n=1; int[][] vec; int[][] lazy; int[] fib; int ADD(int a,int b) { int ret=a+b; return ret=0;--i) { for (int j=0;j<3;++j) vec[i][j]=ADD(vec[2*i+1][j],vec[2*i+2][j]); } } void propagate(int k) { long sum=0; for (int i=0;i<3;++i) sum=(sum+(long)lazy[k][i]*vec[k][i])%MOD; vec[k][0]=(int)sum; if (2*k+1<2*n-1) { lazy[2*k+1][0]=(int)((long)lazy[k][0]*lazy[2*k+1][0]%MOD); lazy[2*k+1][1]=(int)((((long)lazy[k][0]*lazy[2*k+1][1]+lazy[k][1]))%MOD); lazy[2*k+1][2]=(int)((((long)lazy[k][0]*lazy[2*k+1][2]+lazy[k][2]))%MOD); lazy[2*k+2][0]=(int)((long)lazy[k][0]*lazy[2*k+2][0]%MOD); lazy[2*k+2][1]=(int)((((long)lazy[k][0]*lazy[2*k+2][1]+lazy[k][1]))%MOD); lazy[2*k+2][2]=(int)((((long)lazy[k][0]*lazy[2*k+2][2]+lazy[k][2]))%MOD); } for (int i=0;i<3;++i) lazy[k][i]=0; lazy[k][0]=1; } int[] query_q0(int a,int b,int k0) { return query_q0(0,n,a,b,0,k0); } void query(int a,int b,int q,int k0) { query(0,n,a,b,0,q,k0); } int[] query_q0(int l,int r,int a,int b,int k,int k0) { propagate(k); if (r<=a||b<=l) return new int[] {0,0,0}; else if (a<=l&&r<=b) { return vec[k]; } else { int[] vl=query_q0(l,(l+r)/2,a,b,2*k+1,k0); int[] vr=query_q0((l+r)/2,r,a,b,2*k+2,k0); vec[k][0]=ADD(vec[2*k+1][0],vec[2*k+2][0]); int[] ret=new int[3]; for (int i=0;i<3;++i) ret[i]=ADD(vl[i],vr[i]); return ret; } } void query(int l,int r,int a,int b,int k,int q0,int k0) { if (r<=a||b<=l) { propagate(k); return; } else if (a<=l&&r<=b) { if (q0==1) { lazy[k][0]=0; lazy[k][1]=k0; lazy[k][2]=0; } else if (q0==2) { propagate(k); lazy[k][1]=k0; } else if (q0==3) { propagate(k); lazy[k][0]=k0; } else if (q0==4) { propagate(k); lazy[k][2]=k0; } propagate(k); } else { propagate(k); query(l,(l+r)/2,a,b,2*k+1,q0,k0); query((l+r)/2,r,a,b,2*k+2,q0,k0); vec[k][0]=ADD(vec[2*k+1][0],vec[2*k+2][0]); } } void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));} } class Main { public static void main(String[] args) { new Main().run(); } final long MOD=(long)(1e9+7); void run() { FastScanner sc = new FastScanner(); int N=sc.nextInt(); int Q=sc.nextInt(); Seg seg=new Seg(N); PrintWriter pw=new PrintWriter(System.out); while (Q-->0) { int q=sc.nextInt(); int l=sc.nextInt(); int r=sc.nextInt()+1; int k=sc.nextInt(); if (q==0) { pw.println((long)seg.query_q0(l, r, k)[0]*k%MOD); } else { seg.query(l, r, q, k); } } pw.flush(); } void tr(Object...o) {System.out.println(Arrays.deepToString(o));} }