#if __has_include(<yoniha/all.h>)
#include <yoniha/all.h>
using namespace atcoder;
#else
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#endif
using namespace std;

#define int long long
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = (int)((n) - 1); i >= 0; i--)
template <typename T> bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template <typename T> bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}

// using mint = modint;

signed main(){
  int x, y, n; cin >> x >> y >> n;
  while(n--){
    int u, v; cin >> u >> v; u--; v--;
    // 同じ枝ならabs(u - v), 違うなら0まで戻る
    int ans = -1;
    if(u == -1 && v == -1) ans = 0;
    else if(u == -1 || v == -1) ans = (u == -1 ? v : u) % y + 1;
    else if(u / y == v / y) ans = abs(u - v);
    else ans = u % y + 1 + v % y + 1;
    cout << ans << '\n';
  }
}