C_1_Skibidus_and_Fanum_Tax_easy_version.cpp

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<bool> vbl;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vstr;
typedef vector<pll> vpll;

#define endl '\n'
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
constexpr ll mod = 1000000007;

inline void Parvez() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); }
template<class T>inline istream& operator>>(istream& in, vector<T>& v) { for (T& x : v) { in >> x; }return in; }template<class T>inline ostream& operator<<(ostream& out, vector<T>& v) { for (ll i = 0;i < v.size() - 1;i++) { out << v[i] << ' '; }out << v[v.size() - 1];return out; }
inline void inp() {}template<class H, class... T>inline void inp(H&& h, T &&...t) { cin >> h;inp(forward<T>(t)...); }inline void print() { cout << endl; }template<class H, class... T>inline void print(H&& h, T &&...t) { cout << h;if (sizeof...(t) != 0)cout << ' ';print(forward<T>(t)...); }




void solution(ll& T) {
	ll n, m; inp(n, m);
	vll a(n), b(m); inp(a, b);
	// if (is_sorted(all(a))) {
	// 	print("YES");
	// 	return;
	// }
	ll bb = b[0];


	ll l = INT_MIN;

	for (ll i = 0; i < n; i++) {
		if (bb - a[i]<a[i] and bb - a[i]>=l) {
			a[i]=bb-a[i];
		}
		l=a[i];
	}
	ll r = INT_MAX;
	for(ll i=n-1; i>=0; i--){
		if(bb-a[i]>a[i] and bb-a[i]<=r){
			a[i]=bb-a[i];
		}
		r=a[i];
	}

	// print(a);
	if (is_sorted(all(a))) {
		print("YES");
	} else {
		print("NO");
	}
}

signed main() {
	Parvez();
	ll TT = 1;
	cin >> TT;
	for (ll T = 1;T <= TT;T++)
		solution(T);
	return 0;
}