#ifndef ONLINE_JUDGE #define _GLIBCXX_DEBUG #endif #include using namespace std; // #include // using namespace atcoder; using ll = long long; // 2^63-1まで 負の値は可 using ull = unsigned long long; // 0<= ull <=2^64-1の範囲 負の値は不可 using vl = vector; using vvl = vector; using P = pair; template using MNPQ = priority_queue, greater>; template using MXPQ = priority_queue, less>; #define rep(i, n) for (int i = 0; i < n; i++) #define srep(i, s, n) for (int i = s; i < n; i++) #define rrep(i, s, n) for (int i = s; i > n; i--) #define chmax(x, y) x = max(x, y) #define chmin(x, y) x = min(x, y) #define nall(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define vunique(v) v.erase(unique(nall(v)), v.end()) #define IN(a, x) find(nall(a), x) != a.end() #define YN(flg) cout << (flg ? "Yes" : "No") << "\n" #define out_grid(x, y, h, w) !(0 <= x && x < h && 0 <= y && y < w) #define lmd(...) [&](__VA_ARGS__) #define debug(x) cerr << #x << " = " << x << endl; const ll INF = 2e18; template istream& operator>>(istream& is, vector& a) { for (auto& x : a) is >> x; return is; } template ostream& operator<<(ostream& os, vector& a) { for (int i = 0; i < (int)a.size(); i++) os << a[i] << " "; return os; } template ostream& operator<<(ostream& os, pair& p) { os << "{" << p.first << "," << p.second << "}"; return os; } template ostream& operator<<(ostream& os, map& a) { for (auto& [k, v] : a) os << "{key:" << k << ", item:" << v << "} "; return os; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); ll x, y, n; cin >> x >> y >> n; vl s(1, 0); rep(i, x) s.push_back(1 + i * y); rep(i, n) { ll u, v; cin >> u >> v; auto ite1 = lower_bound(nall(s), u); auto ite2 = lower_bound(nall(s), v); if (ite1 == s.end() || *ite1 != u) ite1--; if (ite2 == s.end() || *ite2 != v) ite2--; // cout << *ite1 << " " << *ite2 << endl; if (ite1 != ite2) cout << u - *ite1 + v - *ite2 + 1 + (*ite1 != 0 && !*ite2 == 0) << endl; else cout << abs(u - v) << endl; } return 0; }