#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


int main() {
    int h, w, n;
    cin >> h >> w >> n;
    vector<int> a(n), b(n);
    rep(i, n) cin >> a[i] >> b[i];

    ll INF = 1e18;
    vector<ll> ans(n, INF);
    map<int, vector<pair<int, int>>> as;
    rep(i, n) as[b[i]].emplace_back(a[i], i);
    for(auto &[x, v]: as) {
        sort(all(v));
        int s = v.size();
        rep(i, s-1) {
            auto[ai, pi] = v[i];
            auto[aj, pj] = v[i+1];
            chmin(ans[pi], ll(aj-ai));
            chmin(ans[pj], ll(aj-ai));
        }
    }
    map<int, int> min_a;
    rep(i, n) {
        if(min_a.count(b[i])) chmin(min_a[b[i]], a[i]);
        else min_a[b[i]] = a[i];
    }
    rep(i, n) {
        ll tmp = INF;
        if(min_a.count(b[i]-1)) chmin(tmp, ll(min_a[b[i]-1]));
        if(min_a.count(b[i]+1)) chmin(tmp, ll(min_a[b[i]+1]));
        chmin(ans[i], max(tmp, ll(a[i])));
    }

    vector<int> order(n);
    iota(all(order), 0);
    rep(t, 2) {
        sort(all(order), [&](int l, int r) {
            return b[l] < b[r];
        });
        int p = 0;
        ll mn = INF;
        for(int i: order) {
            while(b[order[p]] <= b[i]-2) {
                chmin(mn, ll(a[order[p]] - b[order[p]]));
                p++;
            }
            chmin(ans[i], a[i] + b[i] + mn - 2);
        }
        rep(i, n) b[i] = w+1 - b[i];
    }
    rep(i, n) cout << ans[i] << '\n';
    return 0;
}