#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = (1LL << 62) - (1LL << 31) - 1;

#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)
#define RREP(i, init, n) for(int i = (int)(init); i >= (int)(n); i--)
#define All(A) A.begin(), A.end()
#define rAll(A) A.rbegin(), A.rend()

#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>

long X, Y, N;
vector<plong> P;

void solve() {
    REP(i, 0, N) {
        long u = P[i].first;
        long v = P[i].second;
        if(u == 0) {
            cout << (v - 1) % Y + 1 << endl;
        } else if(v == 0) {
            cout << (u - 1) % Y + 1 << endl;
        } else if((u - 1) / Y == (v - 1) / Y) {
            long ans = abs(((u - 1) % Y) - ((v - 1) % Y));
            cout << ans << endl;
        } else {
            long ans = ((u - 1) % Y) + ((v - 1) % Y) + 2;
            cout << ans << endl;
        }
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    cin >> X >> Y >> N;
    P.resize(N);
    REP(i, 0, N) cin >> P[i].first >> P[i].second;
    solve();
}