#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

ll op(ll a, ll b){
    return a + b;
}

ll e(){
    return 0LL;
}

int main() {
    ll N, Q;
    cin >> N >> Q;
    vector<ll> A(N);
    rep(i, N) cin >> A[i];

    // 平方分割してセグ木
    ll LB = 2000;
    ll LN = 100001;
    vector<segtree<ll, op, e>> segvec1(0);
    vector<segtree<ll, op, e>> segvec2(0);
    for (ll i = 0; i < 50; i++){
        segtree<ll, op, e> seg(LN);
        segvec1.push_back(seg);
        segvec2.push_back(seg);
    }

    for (ll i = 0; i < N; i++){
        segvec1[i / LB].set(A[i], segvec1[i / LB].get(A[i]) + 1);
        segvec2[i / LB].set(A[i], segvec2[i / LB].get(A[i]) + A[i]);
    }
    for (ll i = 0; i < Q; i++){
        ll t;
        cin >> t;
        if (t == 1){
            ll x, y;
            cin >> x >> y;
            x--;
            segvec1[x / LB].set(A[x], segvec1[x / LB].get(A[x]) - 1);
            segvec2[x / LB].set(A[x], segvec2[x / LB].get(A[x]) - A[x]);
            A[x] = y;
            segvec1[x / LB].set(y, segvec1[x / LB].get(y) + 1);
            segvec2[x / LB].set(y, segvec2[x / LB].get(y) + y);
        }
        else{
            ll l, r, a, b;
            cin >> l >> r >> a >> b;
            l--;
            r--;
            
            ll ldiv = l / LB;
            ll lrem = l % LB;
            ll rdiv = r / LB;
            ll rrem = r % LB;

            ll ans = 0;
            if (ldiv == rdiv){
                for (ll j = l; j <= r; j++){
                    ans += max(a, min(b, A[j]));
                }
            }
            else{
                for (ll j = lrem; j < LB; j++){
                    ans += max(a, min(b, A[ldiv * LB + j]));
                }
                for (ll j = 0; j <= rrem; j++){
                    ans += max(a, min(b, A[rdiv * LB + j]));
                }
                for (ll j = ldiv + 1; j < rdiv; j++){
                    ans += segvec2[j].prod(a, b + 1);
                    ans += segvec1[j].prod(0, a) * a;
                    ans += segvec1[j].prod(b + 1, LN) * b;
                }
            }
            cout << ans << endl;
        }
    }
}