// clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979;
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
bool odd(const int &n) { return n & 1; }
bool even(const int &n) { return ~n & 1; }
template<typename T> int len(const T &v) { return v.size(); }
template<typename T = int> T in() { T x; cin >> x; return x; }
template<typename T = int> T in(T &&x) { T z(forward<T>(x)); cin >> z; return z; }
template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &x : v) is >> x; return is; }
template<typename A, typename B> istream &operator>>(istream &is, pair<A, B> &p) { return is >> p.first >> p.second; }
template<typename T> ostream &operator<<(ostream &os, const vector<vector<T>> &v) { int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "" : "\n"); return os; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "" : " "); return os; }
template<typename A, typename B> ostream &operator<<(ostream &os, const pair<A, B> &p) { return os << p.first << ' ' << p.second; }
template<typename Head, typename Value> auto vectors(const Head &head, const Value &v) { return vector<Value>(head, v); }
template<typename Head, typename... Tail> auto vectors(Head x, Tail... tail) { auto inner = vectors(tail...); return vector<decltype(inner)>(x, inner); }
// clang-format on

template<typename LSTTrait> class LazySegTree {
  using FoldMonoid = typename LSTTrait::FoldMonoid;
  using ActionMonoid = typename LSTTrait::ActionMonoid;
  using T = typename FoldMonoid::value_type;
  using Q = typename ActionMonoid::value_type;

  LSTTrait lstTrait; // apply :: (T, Q) -> T, pow :: (Q, int) -> Q
  FoldMonoid foldM;
  ActionMonoid actionM;
  int size = 1;
  vector<T> tree; // 1-indexed
  vector<Q> lazy; // 1-indexed

  void push(int i) {
    stack<pair<int, int>> s;
    for (int d = 1; i /= 2; d *= 2) s.emplace(i, d);
    for (int x, d; s.size(); s.pop()) {
      tie(x, d) = s.top();
      update(x * 2, lazy[x], d);
      update(x * 2 + 1, lazy[x], d);
      lazy[x] = actionM.id();
    }
  }

  void update(const int &i, const Q &x, const int &d) {
    tree[i] = lstTrait.apply(tree[i], lstTrait.pow(x, d));
    if (i < size) lazy[i] = actionM(lazy[i], x);
  }

  void build(int i) {
    for (int d = 2; i /= 2; d *= 2) tree[i] = lstTrait.apply(foldM(tree[i * 2], tree[i * 2 + 1]), lstTrait.pow(lazy[i], d));
  }

public:
  LazySegTree(const int &n = 0) {
    while (size < n) size *= 2;
    tree.assign(size * 2, foldM.id());
    lazy.assign(size, actionM.id());
  }

  LazySegTree(const int &n, const T &x) {
    while (size < n) size *= 2;
    tree.assign(size * 2, x);
    lazy.assign(size, actionM.id());
    for (int i = size - 1; i >= 1; i--) tree[i] = foldM(tree[i * 2], tree[i * 2 + 1]);
  }

  template<typename InputIterator> LazySegTree(InputIterator first, InputIterator last) {
    int n = distance(first, last);
    while (size < n) size *= 2;
    tree.resize(size * 2, foldM.id());
    lazy.assign(size, actionM.id());
    copy(first, last, tree.begin() + size);
    for (int i = size - 1; i >= 1; i--) tree[i] = foldM(tree[i * 2], tree[i * 2 + 1]);
  }

  void act(int l, int r, const Q &x) { // [l, r) += x
    int l0 = l += size, r0 = r += size;
    push(l0), push(r0 - 1);
    for (int d = 1; l < r; l /= 2, r /= 2, d *= 2) {
      if (l & 1) update(l++, x, d);
      if (r & 1) update(--r, x, d);
    }
    build(l0), build(r0 - 1);
  }

  void update(int i, const T &x) {
    push(i += size);
    tree[i] = x;
    while (i /= 2) tree[i] = foldM(tree[i * 2], tree[i * 2 + 1]);
  }

  T fold(int l, int r) { // [l, r)
    T accl = foldM.id(), accr = foldM.id();
    for (push(l += size), push((r += size) - 1); l < r; l /= 2, r /= 2) {
      if (l & 1) accl = foldM(accl, tree[l++]);
      if (r & 1) accr = foldM(tree[--r], accr);
    }
    return foldM(accl, accr);
  }

  T operator[](int i) { return push(i += size), tree[i]; }
};

template<typename T> class RangeSumRangeAdd {
  struct trait {
    struct FoldMonoid {
      using value_type = T;
      value_type id() { return 0; }
      value_type operator()(const value_type &a, const value_type &b) { return a + b; }
    };
    struct ActionMonoid {
      using value_type = T;
      value_type id() { return 0; }
      value_type operator()(const value_type &a, const value_type &b) { return a + b; }
    };
    T apply(const T &t, const T &q) { return t + q; }
    T pow(const T &q, const int &d) { return q * d; }
  };

  LazySegTree<trait> lst;

public:
  RangeSumRangeAdd(const int &n = 0) : lst(n) {}
  RangeSumRangeAdd(const int &n, const T &x) : lst(n, x) {}
  template<typename InputIterator> RangeSumRangeAdd(InputIterator first, InputIterator last) : lst(first, last) {}
  void add(const int &l, const int &r, const T &x) { lst.act(l, r, x); }
  void update(const int &i, const T &x) { lst.update(i, x); }
  T sum(const int &l, const int &r) { return lst.fold(l, r); }
  T operator[](const int &i) { return lst[i]; }
};

main {
  int n, q;
  cin >> n >> q;
  RangeSumRangeAdd<int> rsra(n);
  while (q--) {
    int a, s, t;
    cin >> a >> s >> t;
    --s;
    if (a) {
      cout << rsra.sum(s, t) << endl;
    } else {
      rsra.add(s, t, in());
    }
  }
}



Measured memory_bytes: 6012