#include<iostream>
#include<cstdio>
#define N 100000
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int Ts,n,m,lg[N+1],A[N+1],tong[N+1],length;
struct seg
{
	struct node
	{
		int l,r,cnt,cnt2,lazych;
		long long maxn,lazy;
	};
	node tree[(N<<2)+1];
	void build(int k,int l,int r)
	{
		tree[k].l=l,tree[k].r=r,tree[k].lazy=tree[k].cnt=tree[k].cnt2=0,tree[k].lazych=-1;
		int mid=(l+r)>>1,res=0;
		for (int i=l;i<=r;++i) res=max(res,A[i]),tree[k].cnt+=(res==A[i]);
		res=0;
		for (int i=r;i>=l;--i) res=max(res,A[i]),tree[k].cnt2+=(res==A[i]);
		tree[k].maxn=res;
		if (l==r) return;
		build(k<<1,l,mid),build(k<<1|1,mid+1,r);
		return;
	}
	void push_change(int k,int d)
	{
		tree[k].maxn=tree[k].lazych=d,tree[k].lazy=0,tree[k].cnt=tree[k].cnt2=tree[k].r-tree[k].l+1;
		return;
	}
	void push_add(int k,long long d)
	{
		tree[k].maxn+=d,tree[k].lazy+=d;
		return;
	}
	void spread(int k)
	{
		if (tree[k].lazych!=-1) push_change(k<<1,tree[k].lazych),push_change(k<<1|1,tree[k].lazych),tree[k].lazych=-1;
		if (tree[k].lazy) push_add(k<<1,tree[k].lazy),push_add(k<<1|1,tree[k].lazy),tree[k].lazy=0;
		return;
	}
	int calc(int k,long long d)
	{
		if (tree[k].l==tree[k].r) return tree[k].maxn>=d;
		spread(k);
		if (d<=tree[k<<1].maxn) return calc(k<<1,d)+tree[k].cnt-tree[k<<1].cnt;
		else return calc(k<<1|1,d);
	}
	int calc2(int k,long long d)
	{
		if (tree[k].l==tree[k].r) return tree[k].maxn>=d;
		spread(k);
		if (d<=tree[k<<1|1].maxn) return calc2(k<<1|1,d)+tree[k].cnt2-tree[k<<1|1].cnt2;
		else return calc2(k<<1,d);
	}
	void push_up(int k)
	{
		tree[k].maxn=max(tree[k<<1].maxn,tree[k<<1|1].maxn),tree[k].cnt=tree[k<<1].cnt+calc(k<<1|1,tree[k<<1].maxn),tree[k].cnt2=tree[k<<1|1].cnt2+calc2(k<<1,tree[k<<1|1].maxn);
		return;
	}
	void add(int k,int l,int r,int d)
	{
		if (tree[k].l==l&&tree[k].r==r)
		{
			push_add(k,d);
			return;
		}
		spread(k);
		int mid=(tree[k].l+tree[k].r)>>1;
		if (r<=mid) add(k<<1,l,r,d);
		else if (l>=mid+1) add(k<<1|1,l,r,d);
		else add(k<<1,l,mid,d),add(k<<1|1,mid+1,r,d);
		push_up(k);
		return;
	}
	void change(int k,int l,int r,int d)
	{
		if (tree[k].l==l&&tree[k].r==r)
		{
			push_change(k,d);
			return;
		}
		spread(k);
		int mid=(tree[k].l+tree[k].r)>>1;
		if (r<=mid) change(k<<1,l,r,d);
		else if (l>=mid+1) change(k<<1|1,l,r,d);
		else change(k<<1,l,mid,d),change(k<<1|1,mid+1,r,d);
		push_up(k);
		return;
	}
	long long get_maxn(int k,int l,int r)
	{
		if (tree[k].l==l&&tree[k].r==r) return tree[k].maxn;
		spread(k);
		int mid=(tree[k].l+tree[k].r)>>1;
		if (r<=mid) return get_maxn(k<<1,l,r);
		else if (l>=mid+1) return get_maxn(k<<1|1,l,r);
		else return max(get_maxn(k<<1,l,mid),get_maxn(k<<1|1,mid+1,r));
	}
	void find(int k,int l,int r)
	{
		if (tree[k].l==l&&tree[k].r==r)
		{
			tong[++length]=k;
			return;
		}
		spread(k);
		int mid=(tree[k].l+tree[k].r)>>1;
		if (r<=mid) find(k<<1,l,r);
		else if (l>=mid+1) find(k<<1|1,l,r);
		else find(k<<1,l,mid),find(k<<1|1,mid+1,r);
		return;
	}
};
seg T;
int main()
{
	int op,l,r,sl,sr,x,res;
	long long d,rst;
	for (int i=2;i<=N;++i) lg[i]=lg[i>>1]+1;
	Ts=read();
	while (Ts--)
	{
		n=read(),m=read();
		for (int i=1;i<=n;++i) A[i]=read();
		T.build(1,1,n);
		for (int i=1;i<=m;++i)
		{
			op=read(),l=read(),r=read(),x=read();
			if (op==1) T.add(1,l,r,x);
			else if (op==2) T.change(1,l,r,x);
			else
			{
				if (l<=x&&x<=r)
				{
					sl=sr=x,d=T.get_maxn(1,x,x);
					for (int j=lg[r-x+1];j>=0;--j)
						if (sr+(1<<j)<=r&&T.get_maxn(1,x+1,sr+(1<<j))<=d)
							sr+=(1<<j);
					for (int j=lg[x-l+1];j>=0;--j)
						if (sl-(1<<j)>=l&&T.get_maxn(1,sl-(1<<j),x-1)<=d)
							sl-=(1<<j);
					res=sr-sl+1;
					if (sr+1<=r)
					{
						rst=d,length=0,T.find(1,sr+1,r);
						for (int j=1;j<=length;++j) res+=T.calc(tong[j],rst),rst=max(rst,T.tree[tong[j]].maxn);
					}
					if (l<=sl-1)
					{
						rst=d,length=0,T.find(1,l,sl-1);
						for (int j=length;j>=1;--j) res+=T.calc2(tong[j],rst),rst=max(rst,T.tree[tong[j]].maxn);
					}
					printf("%d\n",res);
				}
				else if (x<l)
				{
					d=T.get_maxn(1,x,l-1),sr=l-1;
					for (int j=lg[r-l+1];j>=0;--j)
						if (sr+(1<<j)<=r&&T.get_maxn(1,l,sr+(1<<j))<=d)
							sr+=(1<<j);
					res=sr-l+1;
					if (sr+1<=r)
					{
						rst=d,length=0,T.find(1,sr+1,r);
						for (int j=1;j<=length;++j) res+=T.calc(tong[j],rst),rst=max(rst,T.tree[tong[j]].maxn);
					}
					printf("%d\n",res);
				}
				else if (x>r)
				{
					d=T.get_maxn(1,r+1,x),sl=r+1;
					for (int j=lg[r-l+1];j>=0;--j)
						if (sl-(1<<j)>=l&&T.get_maxn(1,sl-(1<<j),r)<=d)
							sl-=(1<<j);
					res=r-sl+1;
					if (l<=sl-1)
					{
						rst=d,length=0,T.find(1,l,sl-1);
						for (int j=length;j>=1;--j) res+=T.calc2(tong[j],rst),rst=max(rst,T.tree[tong[j]].maxn);
					}
					printf("%d\n",res);
				}
			}
		}
	}
	return 0;
}