#include <bits/stdc++.h>
using namespace std;
//#include<atcoder/all>
//using namespace atcoder;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
constexpr ll MAX = 2000000000000000000;
constexpr ld PI = 3.14159265358979;
constexpr ll MOD = 0;//2024948111;
ld dotorad(ld K){ return PI * K / 180.0; }
ld radtodo(ld K){ return K * 180.0 / PI; }
mt19937 mt;
void randinit(){ srand((unsigned)time(NULL));mt = mt19937(rand()); }
int main(){
    ll H,W,N;
    cin >> H >> W >> N;
    unordered_map<ll,vector<ll>> mp;
    vector<ll> A(N),B(N);
    vector<ll> Z;
    for(ll i = 0;i < N;i++){
        cin >> A[i] >> B[i];
        mp[B[i]].push_back(A[i]);
        Z.emplace_back(B[i]);
    }
    sort(Z.begin(),Z.end());
    Z.erase(unique(Z.begin(),Z.end()),Z.end());
    vector<ll> memo1(Z.size(),-1),memo2(Z.size(),-1),dis(Z.size(),MAX);
    priority_queue<tuple<ll,ll,ll>,vector<tuple<ll,ll,ll>>,greater<tuple<ll,ll,ll>>> que;
    for(ll i = 0;i < N;i++){
        ll idx = lower_bound(Z.begin(),Z.end(),B[i]) - Z.begin();
        que.emplace(A[i] - 1,idx,idx);
    }
    while(!que.empty()){
        auto [x,y,z] = que.top();
        que.pop();
        if(memo1[y] == -1){
            memo1[y] = z;
            if(y != z) dis[y] = x;

            if(y != 0){
                que.emplace(x + Z[y] - Z[y - 1],y-1,z);
            }
            if(y != Z.size() - 1){
                que.emplace(x + Z[y + 1] - Z[y],y+1,z);
            }
        }
        else if(memo2[y] == -1 && memo1[y] != z){
            memo2[y] = z;
            if(dis[y] == MAX) dis[y] = x;
            if(y != 0){
                que.emplace(x + Z[y] - Z[y - 1],y-1,z);
            }
            if(y != Z.size() - 1){
                que.emplace(x + Z[y + 1] - Z[y],y+1,z);
            }
        }
    }
    for(auto &x : mp){
        sort(x.second.begin(),x.second.end());
    }
    for(ll q = 0;q < N;q++){
        ll a,b;
        a = A[q];
        b = B[q];
        ll ans = MAX;
        {
            auto p = lower_bound(mp[b].begin(),mp[b].end(),a);
            if(p != mp[b].begin()){
                ans = min(ans,abs(a - *prev(p)));
            }
            if(p != mp[b].end()) p++;
            if(p != mp[b].end()){
                ans = min(ans,abs(a - *p) );
            }
        }
        {
            auto p = lower_bound(mp[b - 1].begin(),mp[b - 1].end(),a);
            if(p != mp[b - 1].begin()){
                ans = min(ans,abs(a - *prev(p)) + min(a,*prev(p)));
            }
            if(p != mp[b - 1].end()){
                ans = min(ans,abs(a - *p) + min(a,*p));
            }
        }
        {
            auto p = lower_bound(mp[b + 1].begin(),mp[b + 1].end(),a);
            if(p != mp[b + 1].begin()){
                ans = min(ans,abs(a - *prev(p)) + min(a,*prev(p)));
            }
            if(p != mp[b + 1].end()){
                ans = min(ans,abs(a - *p) + min(a,*p));
            }
        }
        ans = min(ans,dis[lower_bound(Z.begin(),Z.end(),b) - Z.begin()] + a - 1);
        cout << ans << endl;
    }
}