#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define ld double
#define llu long long unsigned

#define mx 100001

int arr[ mx ];

struct info {
    ll prop, sum;
} tree[mx * 3];

void init(int node, int b, int e)
{
    if (b == e) {
        tree[node].sum = arr[b];
        return;
    }
    int Left = node << 1;
    int Right = ( node << 1 ) + 1;
    int mid = (b + e) >> 1;
    init(Left, b, mid);
    init(Right, mid + 1, e);
    tree[node].sum = tree[Left].sum + tree[Right].sum;
}

void update(int node, int b, int e, int i, int j, int x)
{
    if (i > e || j < b)
        return;
    if (b >= i && e <= j)
    {
        tree[node].sum += ((e - b + 1) * x);    //  adding sum
        tree[node].prop += x;
        return;
    }
    int Left = node << 1;
    int Right = (node << 1) + 1;
    int mid = (b + e) >> 1;
    update(Left, b, mid, i, j, x);
    update(Right, mid + 1, e, i, j, x);
    tree[node].sum = tree[Left].sum + tree[Right].sum + (e - b + 1) * tree[node].prop;
}

ll query(int node, int b, int e, int i, int j, int carry = 0)
{
    if (i > e || j < b)
        return 0;

    if (b >= i and e <= j)
        return tree[node].sum + carry * (e - b + 1);

    int Left = node << 1;
    int Right = (node << 1) + 1;
    int mid = (b + e) >> 1;

    ll p1 = query(Left, b, mid, i, j, carry + tree[node].prop);
    ll p2 = query(Right, mid + 1, e, i, j, carry + tree[node].prop);

    return p1 + p2;
}

int main()
{
    fast;
    int t;
    cin>>t;
    while( t-- )
    {
        memset( arr , 0 , sizeof( arr ) );
        int n , q;
        cin>>n>>q;
//        for( int i = 1 ; i <= n ; i++ )
//            cin>>arr[i];
        init( 1 , 1 , n );
        while( q-- )
        {
            int x;
            cin>>x;
            if( x == 0 )
            {
                int i , j , val;
                cin>>i>>j>>val;
                update( 1 , 1 , n , i , j , val );
            }
            else
            {
                int i , j;
                cin>>i>>j;
                cout<<query( 1 , 1 , n , i , j )<<endl;
            }
        }

    }

    return 0;
}