#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)

int main(){
	int h,w,n;
	cin>>h>>w>>n;
	vector<int> a(n),b(n);
	rep(i,n) cin>>a.at(i)>>b.at(i);
	vector<ll> ans(n,1e18);
	map<int,vector<pair<ll,ll>>> mp;
	rep(i,n) mp[b.at(i)].push_back({a.at(i),i});
	for(auto&[k,v]:mp){
		sort(v.begin(),v.end());
		int m=v.size();
		rep(i,m){
			if(i>0) ans.at(v.at(i).second)=min(ans.at(v.at(i).second),v.at(i).first-v.at(i-1).first);
			if(i+1<m) ans.at(v.at(i).second)=min(ans.at(v.at(i).second),v.at(i+1).first-v.at(i).first);
		}
	}
	for(auto&[k,v]:mp){
		for(int shf:{-1,1}){
			if(mp.count(k-shf)){
				auto[mn,j]=mp.at(k-shf).front();
				for(auto[p,i]:v){
					ll tmp=0;
					tmp+=min(mn,p);
					tmp+=abs(mn-p);
					ans.at(i)=min(ans.at(i),tmp);
				}
			}
		}
	}
	vector<pair<int,ll>> vp;
	for(auto&[k,v]:mp){
		vp.push_back({k,v.front().first});
	}
	int m=vp.size();
	vector<ll> rmn(m,1e18),lmn(m,1e18);
	rep(i,m-1){
		lmn.at(i+1)=min(lmn.at(i),vp.at(i).second)+vp.at(i+1).first-vp.at(i).first;
	}
	for(int i=m-1;i>0;i--){
		rmn.at(i-1)=min(rmn.at(i),vp.at(i).second)+vp.at(i).first-vp.at(i-1).first;
	}
	rep(i,m){
		auto &v=mp.at(vp.at(i).first);
		ll tmp=min(lmn.at(i),rmn.at(i));
		for(auto[p,j]:v){
			ans.at(j)=min(ans.at(j),tmp+p-2);
		}
	}
	rep(i,n) cout<<ans.at(i)<<"\n";
}