#include<bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, m;
int a[N], tree[4*N], t_tag[4*N];

void build_tree(int node, int start, int end){
  if(start == end){
    tree[node] = a[start];
    return ;
  }
  int mid = (start + end) / 2;
  int left_node  = 2 * node;
  int right_node = 2 * node + 1;
  build_tree(left_node, start, mid);
  build_tree(right_node, mid + 1, end);
  tree[node] = tree[left_node] + tree[right_node];
}

void pushdown(int node, int start, int end){
  int mid = (start + end) / 2;
  int left_node  = 2 * node;
  int right_node = 2 * node + 1;
  tree[left_node] += t_tag[node] * (mid - start + 1);
  t_tag[left_node] += t_tag[node];
  tree[right_node] += t_tag[node] * (end - mid);
  t_tag[right_node] += t_tag[node];
  t_tag[node] = 0;
}

void update_tree(int node, int start, int end, int L, int R, int k){
  if(L <= start && end <= R){
    tree[node] += (R - L + 1) * k;
    t_tag[node] += k;
    return ;
  }
  pushdown(node, start, end);
  int mid = (start + end) / 2;
  int left_node  = 2 * node;
  int right_node = 2 * node + 1;
  if(L <= mid){
    update_tree(left_node, start, mid, L, R, k);
  }
  if(R >= mid + 1){
    update_tree(right_node, mid + 1, end, L, R, k);
  }
  tree[node] = tree[left_node] + tree[right_node];
}

int query(int node, int start, int end, int x, int y){
  if(x <= start && end <= y){
    return tree[node];
  }
  pushdown(node, start, end);
  int ans = 0;
  int mid = (start + end) / 2;
  int left_node  = 2 * node;
  int right_node = 2 * node + 1;
  if(x <= mid){
    ans += query(left_node, start, mid, x, y);
  }
  if(y > mid){
    ans += query(right_node, mid + 1, end, x, y);
  }
  return ans;
}

int main(){
  cin >> n >> m;
  for(int i = 1;i <= n;i++){
    cin >> a[i];
  }
  build_tree(1, 1, n);
  int x, y, k;
  while(m--){
    int f;
    cin >> f;
    if(f == 1){
      cin >> x >> y >> k;
      update_tree(1, 1, n, x, y, k);
    } else {
      cin >> x >> y;
      cout << query(1, 1, n, x, y) << endl;
    }
  }
  return 0;
}