#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    ll X, Y, N; cin >> X >> Y >> N;
    while(N--){
        ll u, v; cin >> u >> v;
        u--; v--;
        if(u == -1){
            cout << v%Y+1 << "\n";
        }else{
            if(u/Y == v/Y){
                cout << v%Y-u%Y << "\n";
            }else{
                cout << (v%Y+1) + (u%Y+1) << "\n";
            }
        }
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}