#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define sc second

void solve() {
    int h, w, n; cin >> h >> w >> n;
    vector<pair<int, int>> a(n);
    for (int i = 0; i < n; i++) {cin >> a[i].first >> a[i].second; a[i].first--; a[i].second--; }
    int ans = 1e9;
    vector<int> ups, dwns;
    for (int i = 0; i < n; i++) ups.pb(a[i].first - 1);
    for (int i=0;i<n;i++)dwns.pb(h-a[i].first);
    sort(all(ups));reverse(all(ups));sort(all(dwns)); reverse(all(dwns));
    for (int up : ups) {
         if (up>ans)continue;
        for (int down : dwns) {
            if (up+down>ans)continue;
            for (int left=0;left<w;left++) {
                if (up+left+down>ans)continue;
                for (int right = 0;right<w;right++) {
                    if (up+left+right+down>ans)continue;
                    vector<vector<int>> us(h+1, vector<int>(w+1));
                    for (int i = 0; i < n; i++) {
                        int I1 = max(0, a[i].first - up), I2 = min(h - 1, a[i].first + down), J1 = max(0, a[i].second - left), J2 = min(w - 1, a[i].second + right);
                        us[I1][J1]++;
                        us[I1][J2 + 1]--;
                        us[I2 + 1][J1]--;
                        us[I2 + 1][J2 + 1]++;
                    }
                    //cout<<up<<' '<<down<<' '<<left<<' '<<right<<'\n';
                    bool good = true;
                    if (!us[0][0]) continue;
                    for (int i = 0; i < n; i++) {
                        if(!good)break;
                        for (int j = 0; j < w; j++) {
                            if (i > 0) us[i][j] += us[i - 1][j];
                            if (j > 0) us[i][j] += us[i][j - 1];
                            if (i>0&&j>0) us[i][j] -= us[i-1][j-1];
                            if (us[i][j]==0) {
                                good=false;break;
                            }
                        }
                    }
                    if(good)ans=min(ans,up+down+left+right);
                }
            }
        }
    }
    cout << ans << '\n';
}

signed main() {
    int tt = 1;
    #ifdef LOCAL 
        freopen("in.txt", "r", stdin);
        freopen("out1.txt", "w", stdout);

        cin >> tt;
    #else
        ios::sync_with_stdio(false); 
        cin.tie(0); cout.tie(0);
    #endif

    while (tt--) {
        solve();
    }

    return 0;
}