#include <bits/stdc++.h>
using namespace std;

__attribute__((constructor))
void fast_io() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

#include <atcoder/modint>
#include <atcoder/lazysegtree>
using namespace atcoder;
using mint = modint1000000007;

using S = tuple<mint, mint, mint>;
S op(S a, S b) {
    auto [p, q, r] = a;
    auto [s, t, u] = b;
    return {p + s, q + t, r + u};
}
S e() { return {0, 0, 0}; }
using F = tuple<mint, mint, mint>;
S mapping(F f, S x) {
    auto [p, q, r] = f;
    auto [s, t, u] = x;
    return {p * s + q * t + r * u, t, u};
}
F composition(F f, F g) {
    auto [p, q, r] = f;
    auto [s, t, u] = g;
    return {p * s, p * t + q, p * u + r};
}
F id() { return {1, 0, 0}; }

int main() {
    int n, q;
    cin >> n >> q;
    vector<mint> f(n);
    vector<S> a(n);
    for (int i = 0; i < n; ++i) {
        if (i == 0) f[0] = 0;
        else if (i == 1) f[1] = 1;
        else f[i] = f[i - 1] + f[i - 2];
        auto& [p, q, r] = a[i];
        q = f[i];
        r = 1;
    }
    lazy_segtree<S, op, e, F, mapping, composition, id> seg(a);

    for (int i = 0; i < q; ++i) {
        int q, l, r, k;
        cin >> q >> l >> r >> k;
        if (q == 0) {
            mint ans = k * get<0>(seg.prod(l, r + 1));
            cout << ans.val() << '\n';
        }
        if (q == 1) {
            seg.apply(l, r + 1, {0, 0, k});
        }
        if (q == 2) {
            seg.apply(l, r + 1, {1, 0, k});
        }
        if (q == 3) {
            seg.apply(l, r + 1, {k, 0, 0});
        }
        if (q == 4) {
            seg.apply(l, r + 1, {1, k, 0});
        }
    }
}