/* Problem URL: https://codeforces.com/contest/2065/problem/C2 */

#include <bits/stdc++.h>

using namespace std;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

int main()
{
    ios::sync_with_stdio(false);
    // cin.tie(nullptr);

    int t;
    cin >> t;
    while (t--) {
        int n, m;
        cin >> n >> m;

        vl a(n);
        cin >> a;
        vl b(m);
        cin >> b;

        sortv(b);

        if (b[0] - a[0] < a[0]) {
            a[0] = b[0] - a[0];
        }

        bool pos = true;
        nrep(i, 1, a.size()) {
            int low = 0;
            int high = b.size() - 1;
            int ans = b.size();
            while (low <= high) {
                int mid = (low + high) / 2;

                if (b[mid] - a[i] >= a[i - 1]) {
                    ans = mid;
                    high = mid - 1;
                    continue;
                }

                low = mid + 1;
            }

            if (ans != b.size() && b[ans] - a[i] > a[i] && a[i] >= a[i - 1]) {
                continue;
            }

            if (ans != b.size() && b[ans] - a[i] >= a[i - 1]) {
                a[i] = b[ans] - a[i];
                continue;
            }

            if (a[i] >= a[i - 1]) {
                continue;
            }
            
            pos = false;
            break;
        }

        cout << (pos ? "YES\n" : "NO\n");
    }
}