#include<bits/stdc++.h> usingnamespace std; using ll=longlong; voidsolve() { int n; cin>>n; int m; cin>>m; std::vector<int> v(n,0); for (int i = 0; i < n; ++i) { cin>>v[i]; } int maxn=0; for (int i = 0; i < n; ++i) { maxn=max(maxn,v[i]); } for (int i = 0; i < m; ++i) { char opt; cin>>opt; int l,r; cin>>l>>r; if(l<=maxn && maxn<=r) { if(opt=='+') maxn++; else maxn--; } cout<<maxn<<" \n"[i==n-1]; } } intmain() { int t=1; cin>>t; for(int i=1;i<=t;i++) { //cout<<"case "<<t<<": "; solve(); } return0; }