#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<long long,long long>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
P f(long long u, long long x, long long y) {
	if (u == 0)return { 0,0 };
	u--;
	return { 1 + u / y ,u%y };
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int x, y, n; cin >> x >> y >> n;
	rep(i, n) {
		long long u, v; cin >> u >> v;
		if (u > v)swap(u, v);
		auto pu = f(u, x, y);
		auto pv = f(v, x, y);
		if (pu == pair<long long, long long>(0, 0)) {
			cout << pv.second + 1 << endl;
		}
		else if (pu.first == pv.first) {
			cout << pv.second - pu.second << endl;
		}
		else {
			cout << 2 + pv.second + pu.second << endl;
		}
	}
	return 0;
}