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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int H,W,N; cin >> H >> W >> N;
    
    map<long long,vector<long long>> X;
    vector<tuple<long long,long long,int>> XY(N);
    int idx = 0;
    for(auto &[x,y,pos] : XY) cin >> x >> y,swap(x,y),X[x].push_back(y),pos = idx++;
    long long inf = 4e18;
    vector<long long> answer(N,inf);
    for(int i=0; i<N; i++){
        auto[x,y,ig] = XY.at(i);
        auto &look = X[x];
        int pos = upper_bound(look.begin(),look.end(),y)-look.begin();
        if(pos != look.size()) answer.at(i) = look.at(pos)-y;
        pos--; pos--;
        if(pos != -1) answer.at(i) = min(answer.at(i),y-look.at(pos));

        auto itr = X.find(x-1);
        if(itr != X.end()) answer.at(i) = min(answer.at(i),max(y,X[x-1].at(0)));
        itr = X.find(x+1);
        if(itr != X.end()) answer.at(i) = min(answer.at(i),max(y,X[x+1].at(0)));
    }
    
    sort(XY.rbegin(),XY.rend());
    set<pair<long long,int>> man;
    for(auto [x,y,pos] : XY){
        if(man.size() == 0){man.insert({x+y,pos}); continue;}
        auto[mind,pos2] = *man.begin();
        long long now = mind-1-x + y-1; 
        answer.at(pos) = min(answer.at(pos),now);
        answer.at(pos2) = min(answer.at(pos2),now);
        man.insert({x+y,pos}); 
    }
    reverse(XY.begin(),XY.end());
    man.clear();
    for(auto [x,y,pos] : XY){
        if(man.size() == 0){man.insert({y-x,pos}); continue;}
        auto[mind,pos2] = *man.begin();
        long long now = x+mind-1 + y-1;
        answer.at(pos) = min(answer.at(pos),now);
        answer.at(pos2) = min(answer.at(pos2),now);
        man.insert({y-x,pos});        
    }

    for(auto ans : answer) cout << ans << "\n";
}