//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <tuple>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;


const int M = 1000000000+7;
struct Int {
    uint64_t i;
    Int()      {i = 0;}
    Int(uint64_t x) {i = x % M;}
    Int operator+(Int other) {
        return Int(this->i + other.i);
    }
    Int operator*(Int other) {
        return Int(this->i * other.i);
    }
};

struct Fibo {
    vector<Int> f;

    Fibo() {
        f = vector<Int>(2);
        f[0] = Int(0);
        f[1] = Int(1);
    }

    Int fibo(uint64_t n) {
        if(n >= f.size()) {
            FOR(i, f.size(), n+1) {
                f.push_back(f[f.size()-1] + f[f.size()-2]);
            }
        }
        return f[n];
    }
};

int main() {
    Fibo f = Fibo();
    uint64_t N, Q;
    cin >> N >> Q;
    vector<Int> a = vector<Int>(N);
    REP(i, N) {
        a[i] = Int(0);
    }
    REP(i, Q) {
        uint64_t _q, _l, _r, _k;
        cin >> _q >> _l >> _r >> _k;
        Int q(_q), l(_l), r(_r), k(_k);

        if(_q == 0) {
            Int sum = Int(0);
            FOR(i, _l, _r+1) {
                sum = sum + a[i];
            }
            Int ret = sum * k;
            cout << ret.i << endl;

        } else if(_q == 1) {
            FOR(i, _l, _r+1) {
                a[i] = k;
            }
        } else if(_q == 2) {
             FOR(i, _l, _r+1) {
                a[i] = a[i] + k;
            }           
        } else if(_q == 3) {
             FOR(i, _l, _r+1) {
                a[i] = a[i] * k;
            }
        } else {
             FOR(i, _l, _r+1) {
                a[i] = a[i] + k * f.fibo(i);
            }
        }
    }
    return 0;
}