#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <array>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <bit>
#include <chrono>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define For(i, a, b) for (ll i = (a); i < (b); i++)
#define debug(...) cerr << __LINE__ << " | ", debug_out(#__VA_ARGS__, __VA_ARGS__)
#define test_only(x, y, ...) do { if ((x) != (y)) { debug(x, y, ##__VA_ARGS__); } } while (0)
#define test_same(x, y, ...) do { if ((x) != (y)) { debug(x, y, ##__VA_ARGS__); abort(); } } while (0)
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long double ld;
template<class T> using P = pair<T, T>;
template<class T> using pri_l = priority_queue<T>;
template<class T> using pri_s = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = 1000000010;
constexpr ll INF = 1000000000000000010;
constexpr int mod1e9 = 1000000007;
constexpr int mod998 = 998244353;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
constexpr ll ten(int n) { return n ? 10 * ten(n - 1) : 1; };
int dx[] = { 1,0,-1,0,1,1,-1,-1,0 }; int dy[] = { 0,1,0,-1,1,-1,1,-1,0 };
ll mul(ll a, ll b) { return (b != 0 && a > INF / b ? INF : a * b); }
void fail() { cout << "-1\n"; exit(0); } void no() { cout << "No\n"; exit(0); }
template<class T> void er(T a) { cout << a << '\n'; exit(0); }
template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
template<class T> istream& operator >>(istream& s, vector<T>& v) { for (auto& e : v) s >> e; return s; }
template<class T> ostream& operator <<(ostream& s, const vector<T>& v) { for (auto& e : v) s << e << ' '; return s; }
template<class T, class U> ostream& operator << (ostream& s, const pair<T, U>& p) { s << p.first << ' ' << p.second; return s; }

struct fastio {
	fastio() {
		cin.tie(0); cout.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(20);
		cerr << fixed << setprecision(20);
	}
}fastio_;

namespace rdv {
	random_device seed_gen;
	mt19937_64 engine(seed_gen());
	ll rnum(ll r) { return engine() % r; } // [0, r)
	ll rnum(ll l, ll r) { return rnum(r - l) + l; } // [l, r)
	ll rng(ll l, ll r) { return rnum(l, r + 1); } // [l, r]
	double rng01() { return engine() * pow(2, -64); }
	template<class T> void shuf(vector<T>& v) { shuffle(all(v), engine); }
	void shuf(string& s) { shuffle(all(s), engine); }
}

using namespace rdv;

template<class T> vector<int> compress(vector<T> v) {
	int n = ssize(v);
	vector<T> tmp = v;
	sort(tmp.begin(), tmp.end());
	tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
	vector<int> res(n);
	for (int i = 0; i < n; i++) res[i] = lower_bound(tmp.begin(), tmp.end(), v[i]) - tmp.begin();
	return res;
}

#ifdef _MSC_VER
int popcount(int v) { return popcount(uint(v)); }
int popcount(ll v) { return popcount(ull(v)); }
using lint = ll;
#else 
int popcount(int v) { return __builtin_popcount(v); }
int popcount(uint v) { return __builtin_popcount(v); }
int popcount(ll v) { return __builtin_popcountll(v); }
int popcount(ull v) { return __builtin_popcountll(v); }
using lint = __int128_t;
#endif

#include <atcoder/all>
using namespace atcoder;

constexpr ll mod = mod1e9;
using mint = static_modint<mod>;

istream& operator >>(istream& s, mint& m) { ll y; s >> y; m = y; return s; }
istream& operator >>(istream& s, vector<mint>& v) { for (auto& e : v) { ll y; s >> y; e = y; } return s; }
ostream& operator <<(ostream& s, mint& m) { return s << m.val(); }
ostream& operator <<(ostream& s, const vector<mint>& v) { for (auto& e : v) s << e.val() << ' '; return s; }

void debug_out(const char*) { cerr << "\n"; }
template <typename T, typename... Args> void debug_out(const char* names, T value, Args... args) {
	while (*names == ' ') ++names;
	const char* comma = strchr(names, ',');
	if (!comma) { cerr << names << ":" << value << "\n"; }
	else { cerr.write(names, comma - names) << ":" << value << ", "; debug_out(comma + 1, args...); }
}

vector<mint> fac, inv, facinv;

void modcalc(int n) {
	assert(fac.empty()); assert(inv.empty()); assert(facinv.empty());
	fac.resize(n); inv.resize(n); facinv.resize(n);
	fac[0] = 1; fac[1] = 1; inv[1] = 1;
	facinv[0] = 1; facinv[1] = 1;
	for (ll i = 2; i < n; i++) {
		fac[i] = fac[i - 1] * i;
		inv[i] = -inv[mod % i] * (mod / i);
		facinv[i] = facinv[i - 1] * inv[i];
	}
}

mint comb(ll n, ll k) {
	if (n < 0 or k < 0 or n < k) return 0;
	return fac[n] * facinv[k] * facinv[n - k];
}

mint perm(ll n, ll k) {
	if (n < 0 or k < 0 or n < k) return 0;
	return fac[n] * facinv[n - k];
}

mint hom(ll n, ll k) {
	if (n < 0 or k < 0 or (n == 0 && k > 0)) return 0;
	if (n == 0 && k == 0) return 1;
	return fac[n + k - 1] * facinv[k] * facinv[n - 1];
}

#include <chrono>
#include <optional>

template<class Key, class S, auto op, auto e, class F, auto mapping, auto composition, auto id, auto shift_mapping> struct lazy_shift_index_treap {
	struct Node {
		Key key;
		S val, prod;
		F lz;
		bool has_lz;
		Key key_lz;
		bool has_key_lz;
		uint64_t pri;
		int sz;
		Node* l, * r;

		Node(const Key& k, const S& v, uint64_t p)
			: key(k), val(v), prod(v), lz(id()), has_lz(false),
			key_lz(Key()), has_key_lz(false),
			pri(p), sz(1), l(nullptr), r(nullptr) {}
	};

	Node* root = nullptr;

	static uint64_t rng() {
		static mt19937_64 mt((uint64_t)chrono::steady_clock::now().time_since_epoch().count());
		return mt();
	}

	static int node_size(Node* t) {
		return t ? t->sz : 0;
	}

	static S prod_all(Node* t) {
		return t ? t->prod : e();
	}

	static void pull(Node* t) {
		if (!t) return;
		t->sz = 1 + node_size(t->l) + node_size(t->r);
		t->prod = op(prod_all(t->l), op(t->val, prod_all(t->r)));
	}

	static void apply_val(Node* t, const F& f) {
		if (!t) return;
		t->val = mapping(f, t->val);
		t->prod = mapping(f, t->prod);
		if (t->has_lz) t->lz = composition(f, t->lz);
		else {
			t->lz = f;
			t->has_lz = true;
		}
	}

	static void apply_key_shift(Node* t, const Key& d) {
		if (!t) return;
		t->key += d;
		t->val = shift_mapping(d, t->val);
		t->prod = shift_mapping(d, t->prod);
		if (t->has_key_lz) t->key_lz += d;
		else {
			t->key_lz = d;
			t->has_key_lz = true;
		}
	}

	static void push(Node* t) {
		if (!t) return;

		if (t->has_lz) {
			apply_val(t->l, t->lz);
			apply_val(t->r, t->lz);
			t->lz = id();
			t->has_lz = false;
		}
		if (t->has_key_lz) {
			apply_key_shift(t->l, t->key_lz);
			apply_key_shift(t->r, t->key_lz);
			t->key_lz = Key();
			t->has_key_lz = false;
		}
	}

	// a の全 key < b の全 key を仮定
	static Node* merge(Node* a, Node* b) {
		if (!a) return b;
		if (!b) return a;
		push(a);
		push(b);
		if (a->pri > b->pri) {
			a->r = merge(a->r, b);
			pull(a);
			return a;
		}
		else {
			b->l = merge(a, b->l);
			pull(b);
			return b;
		}
	}

	// (< key, >= key)
	static pair<Node*, Node*> split_lt(Node* t, const Key& key) {
		if (!t) return { nullptr, nullptr };
		push(t);
		if (t->key < key) {
			auto [a, b] = split_lt(t->r, key);
			t->r = a;
			pull(t);
			return { t, b };
		}
		else {
			auto [a, b] = split_lt(t->l, key);
			t->l = b;
			pull(t);
			return { a, t };
		}
	}

	// (<= key, > key)
	static pair<Node*, Node*> split_le(Node* t, const Key& key) {
		if (!t) return { nullptr, nullptr };
		push(t);
		if (key < t->key) {
			auto [a, b] = split_le(t->l, key);
			t->l = b;
			pull(t);
			return { a, t };
		}
		else {
			auto [a, b] = split_le(t->r, key);
			t->r = a;
			pull(t);
			return { t, b };
		}
	}

	// (< key, = key, > key)
	static tuple<Node*, Node*, Node*> split_eq(Node* t, const Key& key) {
		auto [a, bc] = split_lt(t, key);
		auto [b, c] = split_le(bc, key);
		return { a, b, c };
	}

	static Node* find_node(Node* t, const Key& key) {
		while (t) {
			push(t);
			if (key < t->key) t = t->l;
			else if (t->key < key) t = t->r;
			else return t;
		}
		return nullptr;
	}

	static void clear(Node* t) {
		if (!t) return;
		push(t);
		clear(t->l);
		clear(t->r);
		delete t;
	}

	template<class G>
	static optional<Key> max_right_fail_dfs(Node* t, S& sm, G g) {
		if (!t) return nullopt;
		push(t);

		S nxt = op(sm, prod_all(t->l));
		if (!g(nxt)) return max_right_fail_dfs(t->l, sm, g);
		sm = nxt;

		nxt = op(sm, t->val);
		if (!g(nxt)) return t->key;
		sm = nxt;

		return max_right_fail_dfs(t->r, sm, g);
	}

	template<class G>
	static optional<Key> min_left_fail_dfs(Node* t, S& sm, G g) {
		if (!t) return nullopt;
		push(t);

		S nxt = op(prod_all(t->r), sm);
		if (!g(nxt)) return min_left_fail_dfs(t->r, sm, g);
		sm = nxt;

		nxt = op(t->val, sm);
		if (!g(nxt)) return t->key;
		sm = nxt;

		return min_left_fail_dfs(t->l, sm, g);
	}

	lazy_shift_index_treap() = default;

	lazy_shift_index_treap(const lazy_shift_index_treap&) = delete;
	lazy_shift_index_treap& operator=(const lazy_shift_index_treap&) = delete;

	~lazy_shift_index_treap() {
		clear(root);
	}

	int size() const {
		return node_size(root);
	}

	bool empty() const {
		return root == nullptr;
	}

	bool contains(const Key& key) {
		return find_node(root, key) != nullptr;
	}

	S get(const Key& key) {
		Node* t = find_node(root, key);
		return t ? t->val : e();
	}

	void set(const Key& key, const S& x) {
		auto [a, b, c] = split_eq(root, key);
		clear(b);
		root = merge(a, merge(new Node(key, x, rng()), c));
	}

	void erase(const Key& key) {
		auto [a, b, c] = split_eq(root, key);
		clear(b);
		root = merge(a, c);
	}

	S prod(const Key& l, const Key& r) {
		auto [a, bc] = split_lt(root, l);
		auto [b, c] = split_lt(bc, r);
		S res = prod_all(b);
		root = merge(a, merge(b, c));
		return res;
	}

	S all_prod() const {
		return prod_all(root);
	}

	void apply(const Key& key, const F& f) {
		auto [a, b, c] = split_eq(root, key);
		apply_val(b, f);
		root = merge(a, merge(b, c));
	}

	void apply(const Key& l, const Key& r, const F& f) {
		auto [a, bc] = split_lt(root, l);
		auto [b, c] = split_lt(bc, r);
		apply_val(b, f);
		root = merge(a, merge(b, c));
	}

	void add_ge_index(const Key& x, const Key& d = Key(1)) {
		auto [a, b] = split_lt(root, x);
		apply_key_shift(b, d);
		root = merge(a, b);
	}

	template<class G>
	optional<Key> max_right(const Key& l, G g) {
		assert(g(e()));
		auto [a, b] = split_lt(root, l);
		S sm = e();
		auto res = max_right_fail_dfs(b, sm, g);
		root = merge(a, b);
		return res;
	}

	template<class G>
	optional<Key> min_left(const Key& r, G g) {
		assert(g(e()));
		auto [a, b] = split_lt(root, r);
		S sm = e();
		auto res = min_left_fail_dfs(a, sm, g);
		root = merge(a, b);
		return res;
	}
};

int op(int a, int b) { return a + b; }
int e() { return 0; }
int mapp(int f, int a) { return a; }
int comp(int g, int f) { return 0; }
int id() { return 0; }
int shift(int d, int a) { return a; }

int main() {

	[[maybe_unused]] bool DEBUG = false;

	int TEST = 1;
	if (DEBUG) cin >> TEST;
	while (TEST--) {
		int n, q;
		cin >> n >> q;
		vector<int> a(n);
		cin >> a;
		lazy_shift_index_treap<int, int, op, e, int, mapp, comp, id, shift> t;
		rep(i, n) t.set(i, a[i]);
		while (q--) {
			int i, x, l, r;
			cin >> i >> x >> l >> r;
			i--; l--;
			t.add_ge_index(i + 1, 1);
			t.set(i + 1, x);
			cout << t.prod(l, r) << '\n';
		}
	}
}