#include <bits/stdc++.h>

#include <atcoder/fenwicktree.hpp>
#include <atcoder/segtree.hpp>
#include <atcoder/modint.hpp>
#include <atcoder/dsu.hpp>
#include <atcoder/lazysegtree.hpp>

using namespace atcoder;
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<>>;
ll ll_min = numeric_limits<ll>::min();
ll ll_max = numeric_limits<ll>::max();
ll ALPHABET_N = 26;
using mint = modint998244353;
#define rep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define rep_(i, k, n) for (ll i = (ll)k; i < (ll)n; i++)
#define all(a) a.begin(), a.end()

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	ll x, y, n;
	cin >> x >> y >> n;
	rep(i, n)
	{
		ll u, v;
		cin >> u >> v;
		v--;
		if (u == 0)
		{
			cout << v % y + 1 << endl;
			continue;
		}
		u--;
		if (u / y == v / y)
		{
			cout << (v - u) << endl;
		}
		else
		{
			cout << (u % y + 1 + (v % y) + 1) << endl;
		}
	}
	return 0;
}