#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for(int i=(0+s); i < (n+s); i++)

//pair<T, T>-> P<T>
template<class T> using P = pair<T, T>;
template<class T> struct item {T A, B, C;};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll X, Y, N;
    cin >> X >> Y >> N;
    // vector<vector<ll>> G(X*Y+1);
    // for(int i=0; i<X; i++){
    //     for(int j=1; j<Y; j++){
    //         G[i*Y+j].push_back(i*Y+j+1);
    //         G[i*Y+j+1].push_back(i*Y+j);
    //     }
    //     G[0].push_back(i*Y+1);
    //     G[i*Y+1].push_back(0);
    // }
    for(int i=0; i<N; i++)
    {
        ll u, v;
        cin >> u >> v;
        if(u==0){
            ll v_amari= v%Y;
            if(v_amari==0)v_amari=Y;
            cout << v_amari << "\n";
        }else{
            ll u_amari=u%Y;
            if(u_amari==0)u_amari=Y;
            ll v_amari=v%Y;
            if(v_amari==0)v_amari=Y;
            ll u_syou= (u-1)/Y;
            ll v_syou=(v-1)/Y;
            if(u_syou==v_syou) cout << v_amari-u_amari << "\n";
            else {
                cout << v_amari+u_amari << "\n";
            }
        }
    }
 
    return 0;
}