#include // {{{ // https://codeforces.com/blog/entry/96344 #pragma GCC optimize("O2,unroll-loops") #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") using namespace std; template [[nodiscard]] static T MIN() { return std::numeric_limits::min(); } template [[nodiscard]] static T MAX() { return std::numeric_limits::max(); } template [[nodiscard]] static T sc(auto&& x) { return static_cast(x); } template [[nodiscard]] static T sz(auto&& x) { return static_cast(x.size()); } #define prln(...) std::println(__VA_ARGS__) #define pr(...) std::print(__VA_ARGS__) #ifdef LOCAL #define dbgln(...) std::println(__VA_ARGS__) #define dbg(...) std::print(__VA_ARGS__) #endif inline static void NO() { prln("NO"); } inline static void YES() { prln("YES"); } using ll = long long; using ld = long double; template using ve = std::vector; template using ar = std::array; template using pa = std::pair; template using tu = std::tuple; template using dq = std::deque; template using qu = std::queue; template using pq = std::priority_queue; template using st = std::stack; auto lb = [](auto... args) { return std::lower_bound(args...); }; auto ub = [](auto... args) { return std::upper_bound(args...); }; #define ff first #define ss second #define eb emplace_back #define pb push_back #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() // }}} void solve() { int n, m; cin >> n >> m; ve out(n + 1, 0); ve> G(n + 1); while (m--) { int u, v; cin >> u >> v; ++out[u]; ++out[v]; G[u].eb(v); G[v].eb(u); } for (int u = 1; u <= n; ++u) { if (out[u] == 1) { int v = G[u][0]; int y = out[v] - 1; for (auto w : G[v]) { if (out[w] > 1) { int x = out[w]; prln("{} {}", x, y); return; } } } } } int main() { // {{{ cin.tie(nullptr)->sync_with_stdio(false); cin.exceptions(cin.failbit); int t = 1; cin >> t; while (t--) { solve(); } return 0; } // }}}