#include <bits/stdc++.h>

using namespace std;

#define int long long
#define fir first
#define sec second
#define mkp make_pair 
#define pb push_back
#define lep( i, l, r ) for ( int i = ( l ); i <= ( r ); ++ i )
#define rep( i, r, l ) for ( int i = ( r ); i >= ( l ); -- i )

typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;

char _c; bool _f; template < class type > inline void read ( type &x ) {
	_f = 0, x = 0;
	while ( _c = getchar (), !isdigit ( _c ) ) if ( _c == '-' ) _f = 1;
	while ( isdigit ( _c ) ) x = x * 10 + _c - '0', _c = getchar (); if ( _f ) { x = -x; }
}

template < class type > inline void chkmin ( type &x, type y ) { x = ( x <= y ? x : y ); }
template < class type > inline void chkmax ( type &x, type y ) { x = ( x >= y ? x : y ); }

const int N = 1e6 + 5;

int n, m;

int tree[N], tag[N], tag2[N]; // tag 表示头元素，tag2 表示公差

void pushup ( int node ) {
  tree[node] = tree[node << 1] + tree[node << 1 | 1];
}

void addtag ( int node, int lt, int rt, int k, int p ) {
  int st = k, ed = k + ( rt - lt ) * p;
  // cout << "cy" << lt << " " << rt << " " << k << " " << p << " " << st << " " << ed << '\n';
  tree[node] += ( st + ed ) * ( rt - lt + 1 ) / 2;
  tag[node] += k, tag2[node] += p;
}

void pushdown ( int node, int lt, int rt ) {
  if ( !tag2[node] ) {
    return ;
  }
  int mid = lt + rt >> 1;
  addtag ( node << 1, lt, mid, tag[node], tag2[node] ), addtag ( node << 1 | 1, mid + 1, rt, tag[node] + ( mid + 1 - lt ) * tag2[node], tag2[node] );
  tag[node] = tag2[node] = 0;
}

void update ( int node, int lt, int rt, int x, int y, int k, int p ) {
  if ( x <= lt && rt <= y ) {
    // cout << lt << " " << rt << " " << k << " " << p << '\n';
    addtag ( node, lt, rt, k, p );
    return ;
  }
  pushdown ( node, lt, rt );
  int mid = lt + rt >> 1;
  if ( x <= mid ) {
    update ( node << 1, lt, mid, x, y, k, p );
  }
  if ( mid + 1 <= y ) {
    update ( node << 1 | 1, mid + 1, rt, x, y, ( mid + 1 - x + 1 ) * p, p );
  }
  pushup ( node );
}

int query ( int node, int lt, int rt, int x, int y ) {
  if ( y < lt || x > rt ) {
    return 0;
  }
  if ( x <= lt && rt <= y ) {
    return tree[node];
  }
  pushdown ( node, lt, rt );
  int mid = lt + rt >> 1;
  return query ( node << 1, lt, mid, x, y ) + query ( node << 1 | 1, mid + 1, rt, x, y );
}

void Solve () {
  cin >> n >> m;
  while ( m -- ) {
    int op;
    cin >> op;
    if ( op == 1 ) {
      int s, l, r;
      cin >> s >> l >> r;
      update ( 1, 1, n, l, r, s, s );
    }
    else {
      int l, r;
      cin >> l >> r;
      cout << query ( 1, 1, n, l, r ) << '\n';
    }
    // for ( int i = 1; i <= n; i ++ ) {
    //   cout << query ( 1, 1, n, i, i ) << " ";
    // }
    // cout << '\n';
  }
}

signed main () {
#ifdef judge
  freopen ( "Code.in", "r", stdin );
  freopen ( "Code.out", "w", stdout );
  freopen ( "Code.err", "w", stderr );
#endif
  Solve ();
	return 0;
}