#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 2e5 + 10, M = 1e7 + 10, INF = 0x3f3f3f3f, mod = 998244353;

namespace MF {
    const int INF = 1e8;
    int n;
    int S, T;
    int h[N], e[M], f[M], ne[M], idx;
    int q[N], d[N], cur[N];
    void clear() {
        T = n * 2 + 1;
        for (int i = 0; i <= n * 2 + 1; ++i) h[i] = -1;
        idx = 0;
    }
    void add_edge(int a, int b, int c) {
        e[idx] = b, f[idx] = c, ne[idx] = h[a], h[a] = idx++;
        e[idx] = a, f[idx] = 0, ne[idx] = h[b], h[b] = idx++;
    }
    bool bfs() {
        int hh = 0, tt = 0;
        memset(d, -1, sizeof d);
        q[0] = S, d[S] = 0, cur[S] = h[S];
        while (hh <= tt) {
            int t = q[hh++];
            for (int i = h[t]; ~i; i = ne[i]) {
                int ver = e[i];
                if (d[ver] == -1 && f[i]) {
                    d[ver] = d[t] + 1;
                    cur[ver] = h[ver];
                    if (ver == T) return 1;
                    q[++tt] = ver;
                }
            }
        }
        return 0;
    }
    int find(int u, int limit) {
        if (u == T) return limit;
        int flow = 0;
        for (int i = cur[u]; ~i && flow < limit; i = ne[i]) {
            cur[u] = i;
            int ver = e[i];
            if (d[ver] == d[u] + 1 && f[i]) {
                int t = find(ver, min(f[i], limit - flow));
                if (!t) d[ver] = -1;
                f[i] -= t, f[i ^ 1] += t, flow += t;
            }
        }
        return flow;
    }
    int dinic() {
        int r = 0, flow;
        while (bfs()) while (flow = find(S, INF)) r += flow;
        return r;
    }
    void wk() {
        vector<bool> st(n * 2 + 1);
        vector<bool> okl(n + 1), okr(n + 1);
        for (int i = 0; i < idx; i += 2) {
            if (e[i ^ 1] == S && f[i]) okl[e[i]] = 1;
            if (e[i] == T && f[i]) okr[e[i ^ 1] - n] = 1;
        }
        function<void(int, int)> dfs = [&](int u, int o) {
            st[u] = 1;
            if (!o && u <= n) okl[u] = 1;
            if (o && u > n) okr[u - n] = 1;
            for (int i = h[u]; ~i; i = ne[i]) {
                int j = e[i];
                if (j == S || j == T || st[j]) continue;
                if (!o && j <= n && !f[i]) continue;
                if (o && j > n && f[i]) continue;
                dfs(j, o);
            }
        };
        for (int i = 1; i <= n; ++i) {
            if (okl[i]) dfs(i, 0);
        }
        st = vector<bool>(n * 2 + 1);
        for (int i = 1; i <= n; ++i) {
            if (okr[i]) dfs(i + n, 1);
        }
        int sl = accumulate(okl.begin(), okl.end(), 0);
        int sr = accumulate(okr.begin(), okr.end(), 0);
        cout << (ll)sl * sr << el;
    }
}

void solve() {
    int n, m; cin >> n >> m;
    MF::n = n;
    MF::clear();
    for (int i = 1; i <= n; ++i) {
        MF::add_edge(MF::S, i, 1);
        MF::add_edge(i + n, MF::T, 1);
    }
    set<pii> used;
    while (m--) {
        int a, b; cin >> a >> b;
        if (used.count({a, b})) continue;
        used.insert({a, b});
        MF::add_edge(a, b + n, 1);
    }
    MF::dinic();
    MF::wk();
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int tcase = 1;
    cin >> tcase;
    while (tcase--) solve();
}