#include <iostream>
#include <cstdio>
#include <cstring>
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
const int N=100000+10;
int d[N*3],maxc[N*3],lc[N*3],rc[N*3],maxc0[N*3],lc0[N*3],rc0[N*3];
int sets[N*3],rev[N*3];
int n,Q;
int A[N];
void up(int rt,int l,int r)
{int mid=(l+r)>>1;d[rt]=d[rt<<1]+d[rt<<1|1];maxc[rt]=max(maxc[rt<<1],maxc[rt<<1|1]);maxc[rt]=max(maxc[rt],lc[rt<<1|1]+rc[rt<<1]);lc[rt]=lc[rt<<1];rc[rt]=rc[rt<<1|1];if (lc[rt<<1]==mid-l+1) lc[rt]+=lc[rt<<1|1];if (rc[rt<<1|1]==r-mid) rc[rt]+=rc[rt<<1];maxc0[rt]=max(maxc0[rt<<1],maxc0[rt<<1|1]);maxc0[rt]=max(maxc0[rt],lc0[rt<<1|1]+rc0[rt<<1]);lc0[rt]=lc0[rt<<1];rc0[rt]=rc0[rt<<1|1];if (lc0[rt<<1]==mid-l+1) lc0[rt]+=lc0[rt<<1|1];if (rc0[rt<<1|1]==r-mid) rc0[rt]+=rc0[rt<<1];
}
void build(int rt,int l,int r)
{sets[rt]=-1;rev[rt]=0;if (l>=r){d[rt]=maxc[rt]=A[l];lc[rt]=rc[rt]=A[l];lc0[rt]=rc0[rt]=maxc0[rt]=1-A[l];return;}int mid=(l+r)>>1;build(lson);build(rson);up(rt,l,r);
}
void pushdown(int rt,int l,int r)
{if (l>=r) return;int mid=(l+r)>>1;if (sets[rt]>=0){maxc[rt<<1]=lc[rt<<1]=rc[rt<<1]=d[rt<<1]=(mid-l+1)*sets[rt];maxc[rt<<1|1]=lc[rt<<1|1]=rc[rt<<1|1]=d[rt<<1|1]=(r-mid)*sets[rt];maxc0[rt<<1]=lc0[rt<<1]=rc0[rt<<1]=(mid-l+1)*(1-sets[rt]);maxc0[rt<<1|1]=lc0[rt<<1|1]=rc0[rt<<1|1]=(r-mid)*(1-sets[rt]);sets[rt<<1]=sets[rt<<1|1]=sets[rt];rev[rt<<1]=rev[rt<<1|1]=0;sets[rt]=-1;}if (rev[rt]>0){d[rt<<1]=(mid-l+1)-d[rt<<1];d[rt<<1|1]=(r-mid)-d[rt<<1|1];int t1,t2,t3;t1=maxc[rt<<1];t2=lc[rt<<1];t3=rc[rt<<1];maxc[rt<<1]=maxc0[rt<<1];lc[rt<<1]=lc0[rt<<1];rc[rt<<1]=rc0[rt<<1];maxc0[rt<<1]=t1;lc0[rt<<1]=t2;rc0[rt<<1]=t3;t1=maxc[rt<<1|1];t2=lc[rt<<1|1];t3=rc[rt<<1|1];maxc[rt<<1|1]=maxc0[rt<<1|1];lc[rt<<1|1]=lc0[rt<<1|1];rc[rt<<1|1]=rc0[rt<<1|1];maxc0[rt<<1|1]=t1;lc0[rt<<1|1]=t2;rc0[rt<<1|1]=t3;rev[rt<<1]^=1;rev[rt<<1|1]^=1;rev[rt]=0;}
}
void change(int val,int L,int R,int rt,int l,int r)
{if (L<=l && r<=R){d[rt]=(r-l+1)*val;lc[rt]=rc[rt]=(r-l+1)*val;maxc[rt]=(r-l+1)*val;lc0[rt]=rc0[rt]=maxc0[rt]=(r-l+1)*(1-val);sets[rt]=val;rev[rt]=0;return;}pushdown(rt,l,r);int mid=(l+r)>>1;if (L>mid) change(val,L,R,rson);elseif (R<=mid) change(val,L,R,lson);else{change(val,L,R,rson);change(val,L,R,lson);}up(rt,l,r);
}
void revers(int L,int R,int rt,int l,int r)
{if (L<=l && r<=R){d[rt]=(r-l+1)-d[rt];int t1,t2,t3;t1=maxc[rt];t2=lc[rt];t3=rc[rt];maxc[rt]=maxc0[rt];lc[rt]=lc0[rt];rc[rt]=rc0[rt];maxc0[rt]=t1;lc0[rt]=t2;rc0[rt]=t3;rev[rt]^=1;return;}pushdown(rt,l,r);int mid=(l+r)>>1;if (R<=mid) revers(L,R,lson);elseif (L>mid) revers(L,R,rson);else{revers(L,R,lson);revers(L,R,rson);}up(rt,l,r);
}
int output(int op,int L,int R,int rt,int l,int r)
{if (L==l && r==R){if (op==3) return d[rt];else  return maxc[rt];}pushdown(rt,l,r);int mid=(l+r)>>1;if (L>mid) return output(op,L,R,rson);elseif (R<=mid) return output(op,L,R,lson);else{int ret1=output(op,L,mid,lson);int ret2=output(op,mid+1,R,rson);if (op==3) return ret1+ret2;else{int ret=max(ret1,ret2);int t1=min(rc[rt<<1],mid-L+1);int t2=min(lc[rt<<1|1],R-mid);ret=max(ret,t1+t2);return ret;}}
}
int main()
{int t,op,a,b;scanf("%d",&t);while (t--){scanf("%d%d",&n,&Q);for (int i=1;i<=n;i++) scanf("%d",&A[i]);build(1,1,n);while (Q--){scanf("%d%d%d",&op,&a,&b);a++;b++;if (op<=1){change(op,a,b,1,1,n);}elseif (op==2){revers(a,b,1,1,n);}else{int ans=output(op,a,b,1,1,n);printf("%d\n",ans);}}}return 0;
}