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


void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector a(n + 1, vector<int>(m + 1));
    for (int i = 1;i <= k;i++) {
        int x, y;cin >> x >> y;
        a[x][y] = 1;
    }
    // for (int i = 1;i <= n;i++) {
    //     for (int j = 1;j <= m;j++) {
    //         cout << a[i][j] << " ";
    //     }
    //     cout << "\n";
    // }
    int ans = k;
    auto ch = [&]() {
        for (int i = 1;i <= n;i++) {
            for (int j = 1;j < m;j++) {
                if (a[i][j] == 1 and a[i][j + 1] == 1)return 0;
            }
        }
        for (int i = 1;i < n;i++) {
            for (int j = 1;j <= m;j++) {
                if (a[i][j] and a[i + 1][j])return 0;
            }
        }
        int cnt = 0;
        for (int i = 1;i <= n;i++) {
            for (int j = 1;j <= m;j++) {
                if (a[i][j])cnt++;
            }
        }
        ans = min(ans, cnt);
        return 1;
    };

    auto dfs = [&](auto&& ff, int x, int y)->void {
        ch();
        for (int i = 1;i <= n;i++) {
            for (int j = 1;j < m;j++) {
                if (a[i][j] == 1 and a[i][j + 1] == 1) {
                    if (j + 1 < m and a[i][j + 2] == 0) {
                        a[i][j + 2] = 1;
                        a[i][j] = 0;a[i][j + 1] = 0;
                        ff(ff, x, y);
                        a[i][j + 2] = 0;
                        a[i][j] = 1;a[i][j + 1] = 1;
                    }
                    if (j > 1 and a[i][j - 1] == 0) {
                        a[i][j - 1] = 1;
                        a[i][j] = 0;a[i][j + 1] = 0;
                        ff(ff, x, y);
                        a[i][j - 1] = 0;
                        a[i][j] = 1;a[i][j + 1] = 1;
                    }
                }
            }
        }
        for (int i = 1;i < n;i++) {
            for (int j = 1;j <= m;j++) {
                if (a[i][j] == 1 and a[i + 1][j] == 1) {
                    if (i + 1 < n and a[i + 2][j] == 0) {
                        a[i + 2][j] = 1;
                        a[i][j] = 0;a[i + 1][j] = 0;
                        ff(ff, x, y);
                        a[i + 2][j] = 0;
                        a[i][j] = 1;a[i + 1][j] = 1;
                    }
                    if (i > 1 and a[i - 1][j] == 0) {
                        a[i - 1][j] = 1;
                        a[i][j] = 0;a[i + 1][j] = 0;
                        ff(ff, x, y);
                        a[i - 1][j] = 0;
                        a[i][j] = 1;a[i + 1][j] = 1;
                    }
                }
            }
        }
        return;
    };

    dfs(dfs, 1, 1);
    cout << ans << "\n";

}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    // freopen("data.out", "w", stdout);
#endif
    cin >> T;
    while (T--)
        solve();
    return 0;
}