/* Author: Pieck */
#include<bits/stdc++.h>
using namespace std;
using namespace chrono;
#pragma GCC optimize("-O2")
typedef long long ll;
typedef long double lld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<ll> vl;
typedef pair<ll, ll> pl;
typedef vector<vector<ll>> matrix;
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time__(d) \
for ( \
auto blockTime = make_pair(chrono::high_resolution_clock::now(), true); \
blockTime.second; \
debug("%s: %lld ms\n", d, chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - blockTime.first).count()), blockTime.second = false \
)
#define F first
#define S second
#define PB push_back
#define PPB pop_back
#define MP make_pair
#define all(c) c.begin(), c.end()
#define f(i,a,b) for(ll i=a; i<b; i++)
#define rep(i,n) f(i,0,n)
#define fd(i, b, a) for(ll i=b; i>=a; i--)
#define repr(i,n) fd(i, n-1, 0)
#define tr(c,i) for(typeof(c).begin() i = c.begin(); i != c.end(); i++)
#define present(c,x) (c.find(x) != c.end()) //for set and map
#define cpresent(c,x) (find(all(c),x) != c.end()) //for vectors
#define ps(num, places) fixed<<setprecision(places)<<num //use as cout<<ps(x, y)<<"\n";
#define sz(x) (ll)(x).size()
void setIO() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
void usaco(string filename) {
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
template <typename T> void amax(T &a, T b) { a = max(a, b); }
template <typename T> void amin(T &a, T b) { a = min(a, b); }
const lld epsilon = 1e-9;
const ll MOD = 1e9+7;
const ll INF = 1e9;
bool comp(ll a, ll b) {
return (a > b);
}
ll POW(ll a, ll b) {
ll res = 1;
while(b>0) {
if(b&1) res *= a;
a *= a;
b >>= 1;
}
return res;
}
ll binpow(ll a, ll b, ll p=MOD) {
ll res = 1;
a %= p;
while(b>0) {
if(b&1) (res *= a)%=p;
(a *= a)%=p;
b >>= 1;
a %= p;
res %= p;
}
return res;
}
void runcase() {
ll n, m;
cin >> n >> m;
vl a(n), b(m);
rep(i, n) cin >> a[i];
rep(i, m) cin >> b[i];
sort(all(a));
sort(all(b));
auto get_sum = [&](ll &mask) {
ll res = 0;
rep(i, m) if(mask&(1<<i)) res += b[i];
return res;
};
auto convert = [&](ll &submaskRef, ll &mask, ll &len) {
ll res = 0, i = 0, j = 0;
while(i<len && j<m) {
if(mask&(1<<j)) {
if(submaskRef&(1<<i)) res += (1<<j);
i++;
}
j++;
}
return res;
};
ll LIM = 1<<m;
ll dp[LIM][n+1];
// dp[mask][i] = 0/1; if possible to distribute to 0..i their salary using mask values
memset(dp, 0, sizeof(dp));
rep(mask, LIM) dp[mask][0] = 1;
ll pos = 0;
f(i, 1, n+1) {
ll val = a[i-1];
while(pos<m && b[pos]<=val) pos++;
ll tmp = 1<<pos;
bool flag = 0;
f(mask, 1, tmp) {
// f(mask, 1, LIM) {
ll maskSum = get_sum(mask);
if(maskSum<val) continue;
ll len = __builtin_popcountll(mask), localLIM = 1<<len;
rep(submaskRef, localLIM) {
if(dp[mask][i]) break;
ll submask = convert(submaskRef, mask, len);
if(get_sum(submask)==val) dp[mask][i] |= dp[mask^submask][i-1];
}
flag |= dp[mask][i];
}
if(!flag) break;
}
cout<<(dp[LIM-1][n] ? "YES" : "NO")<<"\n";
}
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.precision(10);
#ifndef ONLINE_JUDGE
// setIO();
// usaco("");
#endif
time__("Main") {
ll tests = 1;
cin >> tests;
while(tests--) {
runcase();
}
}
return 0;
}
