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

int main() {
    int T;
    cin >> T;
    while (T--) {
        int N, M;
        cin >> N >> M;
        vector<int> A(M), B(M);
        for (int i = 0; i < M; i++) {
            cin >> A[i] >> B[i];
        }
        vector<int> cumB(M + 1);
        for (int i = 0; i < M; i++) {
            cumB[i + 1] = cumB[i] + B[i];
        }
        assert(cumB[M] == N);
        int l = -2e9, r = 2e9;
        for (int i = 0; i < M; i++) {
            l = max(l, A[i] - cumB[i + 1]);
            r = min(r, A[i] - cumB[i]);
        }
        if (l < r) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
    return 0;
}