#include <bits/stdc++.h>
using namespace std;
#define all(x, y) x.begin() + y, x.end()
#define mkp make_pair
#define pii pair<int, int>
#define pil pair<int, long long>
#define pli pair<long long, int>
#define pll pair<long long, long long>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define rep(name, base, limit) for(int name = base; name <= limit; ++name)
#define per(name, base, limit) for(int name = base; name >= limit; --name)
#define lowbit(x) ((x) & -(x))
#define ls(p) ((p) << 1)
#define rs(p) ((p) << 1 | 1)
const int INF = 0x3f3f3f3f;
const long long LNF = 0x3f3f3f3f3f3f3f3f;

inline long long read()
{
    long long x=0,f=1;char ch=getchar();
    while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
    while (ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
    return x*f;
}
void solve()
{
    int n = read(), m = read(), k = read();
    map<pii, bool> mp;
    rep(i, 1, k)
    {
        int u = read(), v = read();
        mp[{u, v}] = 1;
    }
    int ans = k;
    function<void(map<pii, bool>, int)> dfs = [&](map<pii, bool> mp, int dep) -> void
    {
        ans = min(ans, k - dep);
        for (auto [t, _]: mp)
        {
            auto [x, y] = t;
            if (x - 2 >= 1 && mp.find({x - 1, y}) != mp.end() && mp.find({x - 2, y}) == mp.end())
            {
                auto q(mp);
                q.erase({x - 1, y});
                q.erase({x, y});
                q[{x - 2, y}] = 1;
                dfs(q, dep + 1);
            }
            if (x + 2 <= n && mp.find({x + 1, y}) != mp.end() && mp.find({x + 2, y}) == mp.end())
            {
                auto q(mp);
                q.erase({x + 1, y});
                q.erase({x, y});
                q[{x + 2, y}] = 1;
                dfs(q, dep + 1);
            }
            if (y - 2 >= 1 && mp.find({x, y - 1}) != mp.end() && mp.find({x, y - 2}) == mp.end())
            {
                auto q(mp);
                q.erase({x, y - 1});
                q.erase({x, y});
                q[{x, y - 2}] = 1;
                dfs(q, dep + 1);
            }
            if (y + 2 <= n && mp.find({x, y + 1}) != mp.end() && mp.find({x, y + 2}) == mp.end())
            {
                auto q(mp);
                q.erase({x, y + 1});
                q.erase({x, y});
                q[{x, y + 2}] = 1;
                dfs(q, dep + 1);
            }
        }
    };
    dfs(mp, 0);
    cout << ans;
}

int main()
{
    int t = read();
    while (t--)
    {
        solve();
        if (t) putchar('\n');
    }
    return 0;
}