之前以为是线段树的问题，结果换成checker的线段树还是WA

#include<bits/stdc++.h>
using namespace std;
#define ll long long
inline int fr(){
	ll x=1,t=0;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')x=-1;ch=getchar();}
	while(isdigit(ch)){t=(t<<3)+(t<<1)+(ch^'0');ch=getchar();}
	return x*t;
}
#define ls (u<<1)
#define rs (u<<1|1)
const int maxn = 1e5+5;
const ll inf = LONG_LONG_MAX;
int T,n,m;
ll a[maxn],b[maxn];
struct segtree{
	#define INF LLONG_MAX
	struct data {
	  long long mx, mx2, mn, mn2, cmx, cmn, tmx, tmn, tad;
	  long long sum;
	} t[maxn << 2];

	void pushup(int u) {
	  const int lu = u << 1, ru = u << 1 | 1;
	  t[u].sum = t[lu].sum + t[ru].sum;
	  if (t[lu].mx == t[ru].mx) {
	    t[u].mx = t[lu].mx, t[u].cmx = t[lu].cmx + t[ru].cmx;
	    t[u].mx2 = max(t[lu].mx2, t[ru].mx2);
	  } else if (t[lu].mx > t[ru].mx) {
	    t[u].mx = t[lu].mx, t[u].cmx = t[lu].cmx;
	    t[u].mx2 = max(t[lu].mx2, t[ru].mx);
	  } else {
	    t[u].mx = t[ru].mx, t[u].cmx = t[ru].cmx;
	    t[u].mx2 = max(t[lu].mx, t[ru].mx2);
	  }
	  if (t[lu].mn == t[ru].mn) {
	    t[u].mn = t[lu].mn, t[u].cmn = t[lu].cmn + t[ru].cmn;
	    t[u].mn2 = min(t[lu].mn2, t[ru].mn2);
	  } else if (t[lu].mn < t[ru].mn) {
	    t[u].mn = t[lu].mn, t[u].cmn = t[lu].cmn;
	    t[u].mn2 = min(t[lu].mn2, t[ru].mn);
	  } else {
	    t[u].mn = t[ru].mn, t[u].cmn = t[ru].cmn;
	    t[u].mn2 = min(t[lu].mn, t[ru].mn2);
	  }
	}

	void push_add(int u, int l, int r, int v) {
	  t[u].sum += (r - l + 1ll) * v;
	  t[u].mx += v, t[u].mn += v;
	  if (t[u].mx2 != -INF) t[u].mx2 += v;
	  if (t[u].mn2 != INF) t[u].mn2 += v;
	  if (t[u].tmx != -INF) t[u].tmx += v;
	  if (t[u].tmn != INF) t[u].tmn += v;
	  t[u].tad += v;
	}

	void push_min(int u, int tg) {
	  if (t[u].mx <= tg) return;
	  t[u].sum += (tg * 1ll - t[u].mx) * t[u].cmx;
	  if (t[u].mn2 == t[u].mx) t[u].mn2 = tg; 
	  if (t[u].mn == t[u].mx) t[u].mn = tg;    
	  if (t[u].tmx > tg) t[u].tmx = tg;   
	  t[u].mx = tg, t[u].tmn = tg;
	}

	void push_max(int u, int tg) {
	  if (t[u].mn > tg) return;
	  t[u].sum += (tg * 1ll - t[u].mn) * t[u].cmn;
	  if (t[u].mx2 == t[u].mn) t[u].mx2 = tg;
	  if (t[u].mx == t[u].mn) t[u].mx = tg;
	  if (t[u].tmn < tg) t[u].tmn = tg;
	  t[u].mn = tg, t[u].tmx = tg;
	}

	void pushdown(int u, int l, int r) {
	  const int lu = u << 1, ru = u << 1 | 1, mid = (l + r) >> 1;
	  if (t[u].tad)
	    push_add(lu, l, mid, t[u].tad), push_add(ru, mid + 1, r, t[u].tad);
	  if (t[u].tmx != -INF) push_max(lu, t[u].tmx), push_max(ru, t[u].tmx);
	  if (t[u].tmn != INF) push_min(lu, t[u].tmn), push_min(ru, t[u].tmn);
	  t[u].tad = 0, t[u].tmx = -INF, t[u].tmn = INF;
	}

	void build(int u = 1, int l = 1, int r = n) {
	  t[u].tmn = INF, t[u].tmx = -INF;
	  if (l == r) {
	    t[u].sum = t[u].mx = t[u].mn = a[l];
	    t[u].mx2 = -INF, t[u].mn2 = INF;
	    t[u].cmx = t[u].cmn = 1;
	    return;
	  }
	  int mid = (l + r) >> 1;
	  build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
	  pushup(u);
	}

	void add(int L, int R, int v, int u = 1, int l = 1, int r = n) {
	  if (R < l || r < L) return;
	  if (L <= l && r <= R) return push_add(u, l, r, v); 
	  int mid = (l + r) >> 1;
	  pushdown(u, l, r);
	  add(L, R, v, u << 1, l, mid), add(L, R, v, u << 1 | 1, mid + 1, r);
	  pushup(u);
	}

	void tomin(int L, int R, int v, int u = 1, int l = 1, int r = n) {
	  if (R < l || r < L || t[u].mx <= v) return;
	  if (L <= l && r <= R && t[u].mx2 < v) return push_min(u, v); 
	  int mid = (l + r) >> 1;
	  pushdown(u, l, r);
	  tomin(L, R, v, u << 1, l, mid), tomin(L, R, v, u << 1 | 1, mid + 1, r);
	  pushup(u);
	}

	void tomax(int L, int R, int v, int u = 1, int l = 1, int r = n) {
	  if (R < l || r < L || t[u].mn >= v) return;
	  if (L <= l && r <= R && t[u].mn2 > v) return push_max(u, v);
	  int mid = (l + r) >> 1;
	  pushdown(u, l, r);
	  tomax(L, R, v, u << 1, l, mid), tomax(L, R, v, u << 1 | 1, mid + 1, r);
	  pushup(u);
	}

	long long qsum(int L, int R, int u = 1, int l = 1, int r = n) {
	  if (R < l || r < L) return 0;
	  if (L <= l && r <= R) return t[u].sum;
	  int mid = (l + r) >> 1;
	  pushdown(u, l, r);
	  return qsum(L, R, u << 1, l, mid) + qsum(L, R, u << 1 | 1, mid + 1, r);
	}

	long long qmax(int L, int R, int u = 1, int l = 1, int r = n) {
	  if (R < l || r < L) return -INF;
	  if (L <= l && r <= R) return t[u].mx;
	  int mid = (l + r) >> 1;
	  pushdown(u, l, r);
	  return max(qmax(L, R, u << 1, l, mid), qmax(L, R, u << 1 | 1, mid + 1, r));
	}

	long long qmin(int L, int R, int u = 1, int l = 1, int r = n) {
	  if (R < l || r < L) return INF;
	  if (L <= l && r <= R) return t[u].mn;
	  int mid = (l + r) >> 1;
	  pushdown(u, l, r);
	  return min(qmin(L, R, u << 1, l, mid), qmin(L, R, u << 1 | 1, mid + 1, r));
	}
	//from oi-wiki
}tr;
ll ans[maxn],q2,cnt;
struct query{
	ll type,l,r,x;
	void read(){
		type = fr(),l = fr(),r = fr();
		if(type == 1) x = fr();
		else q2++;
	}
} q[maxn];
int main(){
//	freopen("restore2.in","r",stdin);
//	freopen("restore.out","w",stdout);
	T = fr();
	while(T--){
		for (int i = 1; i <= n * 4; i++) tr.t[i] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
		q2 = 0;
		cnt = 0;
		n = fr(),m = fr();
		for(int i=1;i<=n;i++) b[i] = fr();
		for(int i=1;i<=m;i++){
			q[i].type = q[i].l = q[i].r = q[i].x = 0;
		}
		for(int i=1;i<=m;i++){
			q[i].read();
		}
		cnt = q2;
		for(int i=1;i<=n;i++) a[i] = fr();
		tr.build();
		for(int i=m;i>=1;i--){
			if(q[i].type == 1){
				ll l = q[i].l,r = q[i].r,x = q[i].x;
				tr.add(l,r,-x);
			}else{
				ll l = q[i].l,r = q[i].r;
				ans[cnt--] = tr.qmin(l,r); 
			}
		}
		for(int i=1;i<=q2;i++){
			printf("%lld " ,ans[i]);
		}
		putchar('\n');
	}
}