#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll a[100005];
int n,q;
void solve(){
	scanf("%d%d",&n,&q);
	for(int i=1;i<=n;++i)scanf("%lld",&a[i]);
	while(q--){
		int op;scanf("%d",&op);
		if(op&1){
			int l,r;ll x;
			scanf("%d%d%lld",&l,&r,&x);
			int p=r;while(p%8!=l%8)--p;
			if(r-l+1<=20)for(int i=l;i<=r;++i)a[i]=((a[i]<x)?(x-a[i]):(x+a[i]));
			else{
				for(int i=l;i<p;i+=8){
					a[i]=((a[i]<x)?(x-a[i]):(x+a[i]));
					a[i+1]=((a[i+1]<x)?(x-a[i+1]):(x+a[i+1]));
					a[i+2]=((a[i+2]<x)?(x-a[i+2]):(x+a[i+2]));
					a[i+3]=((a[i+3]<x)?(x-a[i+3]):(x+a[i+3]));
					a[i+4]=((a[i+4]<x)?(x-a[i+4]):(x+a[i+4]));
					a[i+5]=((a[i+5]<x)?(x-a[i+5]):(x+a[i+5]));
					a[i+6]=((a[i+6]<x)?(x-a[i+6]):(x+a[i+6]));
					a[i+7]=((a[i+7]<x)?(x-a[i+7]):(x+a[i+7]));
				}
				for(int i=p;i<=r;++i)a[i]=((a[i]<x)?(x-a[i]):(x+a[i]));
			}
		}else{
			int l,r,p;scanf("%d%d",&l,&r);ll s=0,s0=0,s1=0,s2=0,s3=0,s4=0,s5=0,s6=0,s7=0;
			if(r-l+1<=20)for(int i=l;i<=r;++i)s+=a[i];
			else{
				p=r;while(p%8!=l%8)--p;
				for(int i=l;i<p;i+=8)s0+=a[i],s1+=a[i+1],s2+=a[i+2],s3+=a[i+3],s4+=a[i+4],s5+=a[i+5],s6+=a[i+6],s7+=a[i+7];
				for(int i=p;i<=r;++i)s+=a[i];
			}
			s+=s0+s1+s2+s3+s4+s5+s6+s7;
			printf("%lld\n",s);
	    }
	}
}
int main(){
	int T;cin>>T;
	while(T--)solve();
	return 0;
}