#include<stdio.h>
#include<algorithm>
using namespace std;
const int N=5e5+5;
typedef long long ll;
int n,q,a[N],T;
#define L k<<1
#define R k<<1|1
struct seg{
	ll sum[N<<2],tg[N<<2],ln[N<<2],mn[N<<2];
	bool rv[N<<2];
	void pushup(int k){
		ln[k]=ln[L]+ln[R],sum[k]=sum[L]+sum[R],mn[k]=min(mn[L],mn[R]);
	}
	void pushrv(int k){
		rv[k]^=1,tg[k]=-tg[k],sum[k]=-sum[k];
	}
	void pushtg(int k,ll v){
		sum[k]+=v*ln[k],tg[k]+=v,mn[k]+=v;
	}
	void pushdown(int k){
		if(rv[k]){
			pushrv(L);
			pushrv(R);
			rv[k]=false;
		}
		if(tg[k]){
			pushtg(L,tg[k]);
			pushtg(R,tg[k]);
			tg[k]=0;
		}
	}
	void build(int k,int l,int r){
		if(l==r){
			ln[k]=1,sum[k]=mn[k]=a[l];
			return;
		}
		int mid=l+r>>1;
		build(L,l,mid),build(R,mid+1,r);
		pushup(k);
	}
	void modify(int k,int l,int r,int x,int y,int v,bool ty){
		if(x<=l&&r<=y){
			if(ty)pushrv(k),pushtg(k,v);
			else pushtg(k,-v);
			return;
		}
		int mid=l+r>>1;
		pushdown(k);
		if(x<=mid)modify(L,l,mid,x,y,v,ty);
		if(y>mid)modify(R,mid+1,r,x,y,v,ty);
		pushup(k);
	}
	ll query(int k,int l,int r,int x,int y){
		if(x<=l&&r<=y)return sum[k];
		int mid=l+r>>1;
		pushdown(k);
		ll res=0;
		if(x<=mid)res+=query(L,l,mid,x,y);
		if(y>mid)res+=query(R,mid+1,r,x,y);
		return res;
	}
	void clear(){
		for(int i=1;i<n<<2;++i)sum[i]=ln[i]=mn[i]=tg[i]=rv[i]=0;
	}
}T1,T2;
void clear(int k,int l,int r,int v){
	if(T1.mn[k]>=2*v)return;
	if(l==r){
		T2.sum[k]=abs(T1.sum[k]-v),T2.ln[k]=1;
		T1.sum[k]=T1.ln[k]=0,T1.mn[k]=1e18;
		return;
	}
	T1.pushdown(k),T2.pushdown(k);
	int mid=l+r>>1;
	clear(L,l,mid,v),clear(R,mid+1,r,v);
	T1.pushup(k),T2.pushup(k);
}
void solve(){
	scanf("%d%d",&n,&q);
	T1.clear(),T2.clear();
	for(int i=1;i<=n;++i)scanf("%d",&a[i]);
	T1.build(1,1,n);
	for(int i=1,op,l,r,x;i<=q;++i){
		scanf("%d%d%d",&op,&l,&r);
		if(op==1){
			scanf("%d",&x);
			T2.modify(1,1,n,l,r,x,true);
			clear(1,1,n,x);
			T1.modify(1,1,n,l,r,x,false);
		}else printf("%lld\n",T2.query(1,1,n,l,r));
	}
}
int main(){
	scanf("%d",&T);
	while(T--)solve();
	return 0;
}