#include <iostream>
#include <vector>
#include <atcoder/lazysegtree>
#include <cstdio>
#include <bits/stdc++.h>

using namespace std;
using namespace atcoder;

const long long mod = 1000000007;


struct S {
    long long S;
    long long C;
    long long F;
};

struct F {
    long long a;
    long long p;
    long long c;
    long long f;
    
};

S op(S l, S r) {
	return S{(l.S+r.S)%mod, (l.C+r.C)%mod, (l.F+r.F)%mod};
}

S e() {
	return S{0ll, 0ll, 0ll};
}

F composition(F l, F r) {
	if (r.a!=-1ll){
		return r;
	}
	if (l.a!=-1ll){
		return F{(l.a*r.p+r.c)%mod,1ll,0ll,(l.f*r.p+r.f)%mod};
	}
    return F{-1ll, l.p*r.p%mod, (l.c*r.p+r.c)%mod, (l.f*r.p+r.f)%mod};
}

S mapping(F l, S r) {
    if (l.a!=-1ll){
        return S{((l.a*l.p%mod+l.c)*r.C%mod+l.f*r.F%mod)%mod, r.C, r.F};
    }
    return S{(r.S*l.p%mod+r.C*l.c%mod+l.f*r.F%mod)%mod, r.C, r.F};
}

F id() {
	return F{-1ll, 1ll, 0ll, 0ll};
}

vector<long long> fib;

int main() {
    int N, Q;
    cin >> N >> Q;

    fib.push_back(0ll);
    fib.push_back(1ll);
    for (int i = 2; i < N; ++i) {
        fib.push_back((fib[i - 1] + fib[i - 2]) % mod);
    }
    vector<S> a(N);
    for(int i=0;i<N;i++){
    	a[i]=S{0ll,1ll,fib[i]};
    }
    
    lazy_segtree<S, op, e, F, mapping, composition, id> seg(a);
    for(int q=0;q<Q;q++){
    	int t,l,r;
    	long long k;
    	cin>>t>>l>>r>>k;
    	r+=1;
    	if(t==0){
	    	long long ans=k*(seg.prod(l,r).S)%mod;
	    	cout<<ans<<endl;
    	}
    	else if(t==1){
    		seg.apply(l,r,F({k,1ll,0ll,0ll}));
    	}
    	else if(t==2){
    		seg.apply(l,r,F({-1ll,1ll,k,0ll}));
    	}
    	else if(t==3){
    		seg.apply(l,r,F({-1ll,k,0ll,0ll}));
    	}
    	else if(t==4){
    		seg.apply(l,r,F({-1ll,1ll,0ll,k}));
    	}
    }
    return 0;
}