#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)
#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)
#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)
#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)
#define each(p,a) for(auto &p:a)
typedef vector<ll> vll;
typedef vector<pair<ll ,ll>> vpll;
typedef vector<vector<pair<ll ,ll>>> vvpll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef set<ll> sll;
typedef map<ll , ll> mpll;
typedef pair<ll ,ll> pll;
typedef tuple<ll , ll , ll> tpl3;
typedef tuple<ll , ll , ll , ll> tpl4;
typedef tuple<ll , ll , ll , ll , ll> tpl5;
typedef tuple<ll , ll , ll , ll , ll , ll> tpl6;
#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)
#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)
#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)
#define all(a)  (a).begin(),(a).end()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define sz(x) (ll)x.size()
// << std::fixed << std::setprecision(10)
const ll INF = 1LL << 60;
const ld EPS = 1e-9;
 
ll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}
ll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}
inline ll positive_mod(ll a,ll m){return (a % m + m)%m;}
inline ll popcnt(ull a){ return __builtin_popcountll(a);}
//0indexed
inline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}
inline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}
template<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}
template<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}
template<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;}
template<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << "{" << p.first << "," << p.second << "}";return os;}
template<class... T>void input(T&... a){(cin >> ... >> a);}
void print(){cout << endl;}
template<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}
template<class T> void pspace(const T& a){ cout << a << ' ';}
void perr(){cerr << endl;}
template<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}
void yes(bool i = true){ return print(i?"yes":"no"); }
void Yes(bool i = true){ return print(i?"Yes":"No"); }
void YES(bool i = true){ return print(i?"YES":"NO"); }
template <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}
template <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}
template <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}
template <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}
//grid探索用
vector<ll> _ta = {0,0,1,-1,1,1,-1,-1};
vector<ll> _yo = {1,-1,0,0,1,-1,1,-1};
bool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}
  
ll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}
ll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} 
const ll MOD9 = 998244353LL;
const ll MOD10 = 1000000007LL;

//参照渡しで値を作成して渡す
void Maketest(ll &n){
//配列を渡すときは最初に.clear()をしておく
  random_device seed_gen;
  mt19937_64 rnd(seed_gen());
  
  uniform_int_distribution<ll> da(1, 10);
  uniform_int_distribution<ll> db(0, lpow(10,9));
  n = da(rnd);


  uniform_int_distribution<ll> dc(0, 1);
  uniform_int_distribution<ll> dd(0, 1);
}

vll myans(ll n,ll q,vll a,vector<tpl5> query){
  //答えの型注意
}

vll correct(ll n,ll q,vll a,vector<tpl5> query){
  //答えの型注意
  vll ret;
  rep(i,q){
    auto[type,x,y,mi,ma] = query[i];
    if(type == 1){
      
    }else{
      
    }
  }
}

void test(){

}

void nomal(){

}
 
int main(){
  ios::sync_with_stdio(false);cin.tie(nullptr);
  LL(n,q);
  vll a(n);cin >> a;
  ll d = 8 * lpow(10,2);
  // ll d = 3;
  ll k = lceil(n,d);

  ll lim = lpow(10,5)+2;
  fenwick_tree<ll> fw(lim);

  vector<fenwick_tree<ll>> block(k,fw),cnt(k,fw);

  vll gid(n+10);
  rep(i,n+10)gid[i] = i/d;

  rep(i,n){
    block[gid[i]].add(a[i],a[i]);
    cnt[gid[i]].add(a[i],1);
  }

  rep(i,q){
    LL(type);
    if(type == 1){
      LL(x,y);
      x--;
      block[gid[x]].add(a[x],-a[x]);
      cnt[gid[x]].add(a[x],-1);
      a[x] = y;
      block[gid[x]].add(a[x],a[x]);
      cnt[gid[x]].add(a[x],1);
    }else{
      LL(l,r,mi,ma);
      l--;
      ll ans = 0;
      while(l < r){
        if(l != 0 && gid[l] == gid[l-1]){
          ans += clamp(a[l],mi,ma);
          l++;
        }else if(l+d <= r){
          ans += block[gid[l]].sum(mi,ma+1);
          ans += cnt[gid[l]].sum(0,mi) * mi;
          ans += cnt[gid[l]].sum(ma+1,lim) * ma;
          l+= d;
        }else{
          ans += clamp(a[l],mi,ma);
          l++;
        }
      }
      cout << ans << '\n';
    }
  }


}