Untitled

#include <bits/stdc++.h>

#define all(x) x.begin(), x.end()
#define r_all(x) x.rbegin(), x.rend()
#define sz(x)(ll) x.size()
#define g_max(x, y) x = max(x, y)
#define g_min(x, y) x = min(x, y)
#define rsz(a, n) a.resize(n)
#define ass(a, n) a.assign(n, 0)
#define YES() cout << "YES\n"
#define Yes() cout << "Yes\n"
#define NO() cout << "NO\n"
#define No() cout << "No\n"
#define endl "\n"
#define print(a) for (auto &x: a) cout << x << " "; cout << endl
#define print_pair(a)
#define FOR(i, fr, to) for (long long i = fr; i <= to; i++)
#define RFOR(i, fr, to) for (long long i = fr; i >= to; i--)
#define pb push_back
#define eb emplace_back
#define is insert
#define F first
#define S second

using namespace std;

using ll = long long;
using ld = long double;

using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using stkll = stack<ll>;
using qll = queue<ll>;
using dqll = deque<ll>;
using sll = set<ll>;
using msll = multiset<ll>;
using mll = map<ll, ll>;
using vsll = vector<sll>;
using sc = set<char>;
using pcll = pair<char, ll>;

ll dr[] = {0, 1, 0, -1}, dc[] = {-1, 0, 1, 0};

const ll INF = 1e18;
ll MOD = 1e9 + 7;

ll mod_add(ll u, ll v, ll mod = MOD) {
    u %= mod, v %= mod;
    return (u + v) % mod;
}

ll mod_sub(ll u, ll v, ll mod = MOD) {
    u %= mod, v %= mod;
    return (u - v + mod) % mod;
}

ll mod_mul(ll u, ll v, ll mod = MOD) {
    u %= mod, v %= mod;
    return (u * v) % mod;
}

ll mod_pow(ll u, ll p, ll mod = MOD) {
    ll res = 1;
    u %= mod;

    if (u == 0) {
        return 0;
    }

    while (p > 0) {
        if (p & 1) {
            res = (res * u) % mod;
        }

        p >>= 1;
        u = (u * u) % mod;
    }

    return res;


}

ll mod_inv(ll u, ll mod = MOD) {
    u %= mod;
    ll g = __gcd(u, mod);
    if (g != 1) {
        return -1;
    }

    return mod_pow(u, mod - 2, mod);
}

ll mod_div(ll u, ll v, ll mod = MOD) {
    u %= mod, v %= mod;
    return mod_mul(u, mod_inv(v), mod);
}


template<class T>
vector<T> operator+(vector<T> a, vector<T> b) {
    a.insert(a.end(), b.begin(), b.end());
    return a;
}

pll operator+(pll a, pll b) {
    pll ans = {a.first + b.first, a.second + b.second};
    return ans;
}

template<class A, class B>
ostream &operator<<(ostream &os,
                    const pair<A, B> &p) {
    os << p.first << " " << p.second;
    return os;
}

template<class A, class B>
istream &operator>>(istream &is, pair<A, B> &p) {
    is >> p.first >> p.second;
    return is;
}

template<class T>
ostream &operator<<(ostream &os,
                    const vector<T> &vec) {
    for (auto &x: vec) {
        os << x << " ";
    }

    return os;
}

template<class T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (auto &x: vec) {
        is >> x;
    }

    return is;
}


template<class T>
ostream &operator<<(ostream &os,
                    const set<T> &vec) {
    for (auto &x: vec) {
        os << x << " ";
    }

    return os;
}

template<class A, class B>
ostream &operator<<(ostream &os,
                    const map<A, B> d) {
    for (auto &x: d) {
        os << "(" << x.first << " " << x.second << ") ";
    }

    return os;
}

template<class A>
void read_arr(A a[], ll from, ll to) {
    for (ll i = from; i <= to; i++) {
        cin >> a[i];
    }
}

template<class A>
void print_arr(A a[], ll from, ll to) {
    for (ll i = from; i <= to; i++) {
        cout << a[i] << " ";
    }
    cout << "\n";
}

template<class A>
void print_arr(A a[], ll n) {
    print_arr(a, 0, n - 1);
}

template<class A>
void set_arr(A a[], A val, ll from, ll to) {
    for (ll i = from; i <= to; i++) {
        a[i] = val;
    }
}

template<class A>
void set_arr(A a[], A val, ll n) {
    set_arr(a, val, 0, n - 1);
}


const ll N = 5e5 + 10;



ll n, k, q, m;
ll a[N];
string s, s1, s2, s3;




void init() {
}


ll get_ans() {
    ll ok = 1;
    set<pll> st;

    while (m--) {
        ll u, v;
        cin >> u >> v;

        u = (u - 1 + n) % n, v = ( v - 1 + n) % n;

        if (u > v) {
            swap(u, v);
        }

        ll rem = n - 2 * (v - u);
        if (rem & 1) {
            cout << u << "\n";
        }

        ll u_ = (u - rem + n) %n, v_ = (v + rem + n) % n;

        if (u_ == u && v_ == v) {
            continue;
        }

        if (st.count(make_pair(u_, v_))) {
            st.erase(make_pair(u_, v_));
            continue;
        }

        st.is(make_pair(u, v));
    }


    map<ll, vpll> dict;

    for (auto &[u, v]: st) {
        ll del = (u - v + n) % n;
        if (del == v - u) {
            dict[del].eb(u, v);
        } else {
            dict[del].eb(v, u);
        }
    }

    for (auto &p: dict) {
        sort(all(p.S));

        if (sz(p.S) == 1) {
            cout << p.S << "\n";
            return false;
        }

        ll def = (p.S[1].F - p.S[0].F + n) % n ;
        for (ll i = 0; i < sz(p.S); i++) {
            ll cur = p.S[i].F, nxt = p.S[(i + 1) % sz(p.S)].F;
            if ((nxt - cur + n) % n != def) {
                cout << make_pair(cur, nxt) << "\n";
                return false;
            }
        }
    }


    return true;
}


void single(ll t_id = 0) {
    cin >> n >> m;

    if (get_ans()) {
        Yes();
    } else {
        No();
    }



}

void multiple() {

    ll t;
    cin >> t;

    for (ll i = 0; i < t; i++) {
        single(i);
    }



}

//#endif

#if 0

void multiple() {
    while (cin >> n >> m) {
        if (n == 0 && m == 0) {
            break;
        }

        single();
    }

#endif

int main(int argc, char *argv[]) {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    init();


//    freopen("feast.in", "r", stdin);
//    freopen("feast.out", "w", stdout);

    freopen("../input.txt", "r", stdin);
    multiple();
//    single();


    return 0;


}