#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;cnt<(l);++cnt)
#define iterate(cnt,b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); }
template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }

mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) {
            for (auto it = begin; it != end; ++it) *this >> *it;
        }
    };
    class MaiPrinter {
        int stack_p;
        char stack[32];
    public:
        template<typename T>
        void output_integer(T var) {
            if (var == 0) {
                putchar_unlocked('0');
                return;
            }
            if (var < 0) {
                putchar_unlocked('-');
                var = -var;
            }
            stack_p = 0;
            while (var) {
                stack[stack_p++] = '0' + (var % 10);
                var /= 10;
            }
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        MaiPrinter& operator<<(char c) {
            putchar_unlocked(c);
            return *this;
        }
        MaiPrinter& operator<<(int var) {
            output_integer<int>(var);
            return *this;
        }
        MaiPrinter& operator<<(long long var) {
            output_integer<long long>(var);
            return *this;
        }
        MaiPrinter& operator<(int var) {
            output_integer<int>(var);
            putchar_unlocked(' ');
            return *this;
        }
        MaiPrinter& operator<(long long var) {
            output_integer<long long>(var);
            putchar_unlocked(' ');
            return *this;
        }
        MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
    };
}
MaiScanner scanner;
MaiPrinter printer;





template<typename T>
//typedef int T;
class segtree {
    int size;

public:
    struct VI {
        T val;
        int idx;
        VI(T val = 0, int idx = 0) :val(val), idx(idx) {}

        static inline const VI& max(const VI& a, const VI& b) {
            return a.val == b.val ? (a.idx < b.idx ? a : b) : (a.val >= b.val ? a : b);
        }
        static inline const VI& min(const VI& a, const VI& b) {
            return a.val == b.val ? (a.idx < b.idx ? a : b) : (a.val <= b.val ? a : b);
        }

        inline bool operator==(const VI& e) const {
            return val == e.val && idx == e.idx;
        }
        inline bool operator<(const VI& e) const {
            return (val < e.val) || (idx > e.idx);
        }
    };

private:
    vector<int> mark;
    vector<T> single; // max(min)?????¶?????¬??¨
    vector<pair<T, T>> addtree;   // sum,lazy
    vector<VI> maxtree; // val,idx
public:


    segtree(int n) {
        size = 8;
        while (size < n) size <<= 1;

        addtree.resize(size * 2);
        mark.resize(size * 2);
        single.resize(size * 2);
        maxtree.resize(size * 2);
        _flat();
    }

    void _flat() {
        for (int i = 0; i < size; ++i) {
            maxtree[i + size - 1] = VI(0, i);
        }
        for (int i = size - 2; 0 <= i; --i) {
            int c = 2 * i + 1;
            maxtree[i] = maxtree[c];
        }
    }

    // ??????[begin,end)???????§????val???????????????(private)
    void _addvalrange(int begin, int end, T val, int ptr, int rangebegin, int rangeend) {

        if (rangeend <= begin || end <= rangebegin) return; // note:?????????
        if (begin <= rangebegin && rangeend <= end) {
            addtree[ptr].first += val * (rangeend - rangebegin);
            addtree[ptr].second += val * (rangeend - rangebegin) / 2;
            mark[ptr] |= 3;
            maxtree[ptr].val += val;
            single[ptr] += val;

            //if (rangeend - rangebegin > 1) { // ?????£???????????????
            //    _applyDown(ptr);
            //}
            return;
        }
        //_applyDown(ptr);

        int rangemid = (rangebegin + rangeend) / 2;
        _addvalrange(begin, end, val, ptr * 2 + 1, rangebegin, rangemid);
        _addvalrange(begin, end, val, ptr * 2 + 2, rangemid, rangeend);
        addtree[ptr].first += val * (min(rangeend, end) - max(rangebegin, begin));
        maxtree[ptr] = VI::max(maxtree[ptr * 2 + 1], maxtree[ptr * 2 + 2]);
    }
    // ??????[begin,end)???????§????val???????????????
    inline void addvalrange(int begin, int end, T val) {
        _addvalrange(begin, end, val, 0, 0, size);
    }


    inline void _applyDown(int ptr) {
        //if (size - 1 <= ptr) return;
        if (mark[ptr] & 1) {
            mark[ptr] ^= 1;
            int c1 = ptr * 2 + 1;
            int c2 = ptr * 2 + 2;
            addtree[c1].first += addtree[ptr].second;
            addtree[c1].second += addtree[ptr].second / 2;
            mark[c1] |= 1;
            addtree[c2].first += addtree[ptr].second;
            addtree[c2].second += addtree[ptr].second / 2;
            mark[c2] |= 1;
            addtree[ptr].second = 0;
        }
        if (mark[ptr] & 2) {
            mark[ptr] ^= 2;
            int c1 = ptr * 2 + 1;
            int c2 = ptr * 2 + 2;
            maxtree[c1].val += single[ptr];
            single[c1] += single[ptr];
            mark[c1] |= 2;
            maxtree[c2].val += single[ptr];
            single[c2] += single[ptr];
            mark[c2] |= 2;
            single[ptr] = 0;

        }
    }

    inline void _downward_applyDown(int ptr1) {
        if (1 < ptr1) _downward_applyDown(ptr1 >> 1);
        _applyDown(ptr1 - 1);
    }

    T getval(int index) {
        T sum = 0;
        _downward_applyDown((index + size) >> 1);
        return addtree[index + size - 1].first;
    }

    // ??????[begin,end)??????????±???????(private)
    T _getsumrange(int begin, int end, int ptr, int rangebegin, int rangeend) {
        if (rangeend <= begin || end <= rangebegin) return 0; // note:?????????
        if (begin <= rangebegin && rangeend <= end) return addtree[ptr].first;

        _applyDown(ptr);

        int rangemid = (rangebegin + rangeend) / 2;
        return _getsumrange(begin, end, ptr * 2 + 1, rangebegin, rangemid)
            + _getsumrange(begin, end, ptr * 2 + 2, rangemid, rangeend);
    }
    // ??????[begin,end)??????????±???????
    inline T getsumrange(int begin, int end) {
        return _getsumrange(begin, end, 0, 0, size);
    }

    // ??????[begin,end)????????§?????¨????????????????±???????(private)
    VI _getmaxrange(int begin, int end, int ptr, int rangebegin, int rangeend) {
        if (rangeend <= begin || end <= rangebegin) return VI(0, -1); // note:?????????
        if (begin <= rangebegin && rangeend <= end) return maxtree[ptr];

        _applyDown(ptr);

        int rangemid = (rangebegin + rangeend) / 2;
        VI l = _getmaxrange(begin, end, ptr * 2 + 1, rangebegin, rangemid);
        VI r = _getmaxrange(begin, end, ptr * 2 + 2, rangemid, rangeend);

        if (l.idx == -1) return r;
        if (r.idx == -1) return l;
        return VI::max(l, r);
    }
    // ??????[begin,end)????????§?????¨????????????????±???????
    inline VI getmaxrange(int begin, int end) {
        return _getmaxrange(begin, end, 0, 0, size);
    }
};



ll m, n, kei;


int main() {
    int q;
    scanner >> n >> q;

    segtree<ll> seg(n);

    repeat(_, q) {
        int t;
        scanner >> t;
        if (t == 0) {
            int s, t, x;
            scanner >> s >> t >> x;
            --s; --t;
            seg.addvalrange(s, t + 1, x);
        }
        else {
            int s, t;
            scanner >> s >> t;
            --s; --t;
            printer << (seg.getsumrange(s, t + 1)) << '\n';
        }
    }

    return 0;
}

Measured memory_bytes: 14136