#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incII(i, l, r) for(LL i = (l)    ; i <= (r); i++)
#define incIX(i, l, r) for(LL i = (l)    ; i <  (r); i++)
#define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)
#define incXX(i, l, r) for(LL i = (l) + 1; i <  (r); i++)
#define decII(i, l, r) for(LL i = (r)    ; i >= (l); i--)
#define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--)
#define decXI(i, l, r) for(LL i = (r)    ; i >  (l); i--)
#define decXX(i, l, r) for(LL i = (r) - 1; i >  (l); i--)
#define inc(i, n)  incIX(i, 0, n)
#define dec(i, n)  decIX(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
auto inII = [](auto x, auto l, auto r) { return (l <= x && x <= r); };
auto inIX = [](auto x, auto l, auto r) { return (l <= x && x <  r); };
auto inXI = [](auto x, auto l, auto r) { return (l <  x && x <= r); };
auto inXX = [](auto x, auto l, auto r) { return (l <  x && x <  r); };
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define RV(c) reverse(ALL(c))
#define SC static_cast
#define SI(c) SC<int>(c.size())
#define SL(c) SC<LL >(c.size())
#define RF(e, c) for(auto & e: c)
#define SF(c, ...) for(auto & [__VA_ARGS__]: c)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)
auto * IS = & cin;
auto * OS = & cout;
array<string, 3> SEQ = { "", " ", "" };
// input
template<typename T> T in() { T a; (* IS) >> a; return a; }
// input: tuple
template<typename U, int I> void tin_([[maybe_unused]] U & t) { }
template<typename U, int I, typename A, typename ... B> void tin_(U & t) { (* IS) >> get<I>(t); tin_<U, I + 1, B ...>(t); }
template<typename ... T> auto tin() { tuple<T ...> t; tin_<tuple<T ...>, 0, T ...>(t); return t; }
// input: array
template<typename T, int N> auto ain() { array<T, N> a; inc(i, N) { (* IS) >> a[i]; } return a; }
// input: multi-dimensional vector
template<typename T> T vin() { T v; (* IS) >> v; return v; }
template<typename T, typename N, typename ... M> auto vin(N n, M ... m) {
	vector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;
}
// input: multi-column (tuple<vector>)
template<typename U, int I> void colin_([[maybe_unused]] U & t) { }
template<typename U, int I, typename A, typename ... B> void colin_(U & t) {
	get<I>(t).PB(in<A>()); colin_<U, I + 1, B ...>(t);
}
template<typename ... T> auto colin(int n) {
	tuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;
}
// output
void out_([[maybe_unused]] string s) { }
template<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }
template<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }
auto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };
auto out  = [](auto ... a) { outF("", " " , "\n", a ...); };
auto outS = [](auto ... a) { outF("", " " , " " , a ...); };
auto outL = [](auto ... a) { outF("", "\n", "\n", a ...); };
auto outN = [](auto ... a) { outF("", ""  , ""  , a ...); };
// output: multi-dimensional vector
template<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {
	os << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? "" : SEQ[1]) << v[i]; } return (os << SEQ[2]);
}
template<typename T> void vout_(T && v) { (* OS) << v; }
template<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {
	inc(i, SI(v)) { (* OS) << (i == 0 ? "" : a); vout_(v[i], b ...); }
}
template<typename T, typename A, typename ... B> void vout (T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << a << flush; }
template<typename T, typename A, typename ... B> void voutN(T && v, A a, B ... b) { vout_(v, a, b ...); (* OS)      << flush; }

// ---- ----

// make vector
template<typename T> T MV(T v) { return v; }
template<typename T, typename ... U> auto MV(T v, int a, U ... b) { return vector<decltype(MV(v, b ...))>(a, MV(v, b ...)); }

#define LB(v, x) (lower_bound(ALL(v), x) - v.begin())
#define UB(v, x) (upper_bound(ALL(v), x) - v.begin())

auto mo = [](auto a, auto b) { assert(b != 0); a %= b; if(a < 0) { a += abs(b); } return a; };

int main() {
	auto [n, k] = tin<int, int>();
	vector<int> x(n + 2);
	inc1(i, n) { cin >> x[i]; }
	x.FR = x[1] - k;
	x.BA = x[n] + k;
	vector<array<LL, 3>> L(n + 2), R(n + 2);
	L[n + 1] = { -1, n + 1, 0 };
	dec1(i, n) {
		LL e = LB(x, x[i] + k);
		LL c = L[e][0] + 1;
		L[i] = { c, e, (e - i) * c };
	}
	R[0] = { -1, 0, 0 };
	inc1(i, n) {
		LL e = UB(x, x[i] - k) - 1;
		LL c = R[e][0] + 1;
		R[i] = { c, e, (i - e) * c };
	}
	
	const int B = 18;
	auto pl = MV<pair<int, LL>>({ 0, 0 }, n + 2, B);
	auto pr = MV<pair<int, LL>>({ 0, 0 }, n + 2, B);
	inc(k, B) {
	inc1(i, n + 1) {
		if(k == 0) { pl[i][k] = { L[i][1], L[i][2] }; }
		else {
			pl[i][k].FI = pl[pl[i][k - 1].FI][k - 1].FI;
			pl[i][k].SE = pl[pl[i][k - 1].FI][k - 1].SE + pl[i][k - 1].SE;
		}
	}
	}
	inc(k, B) {
	inc(i, n + 1) {
		if(k == 0) { pr[i][k] = { R[i][1], R[i][2] }; }
		else {
			pr[i][k].FI = pr[pr[i][k - 1].FI][k - 1].FI;
			pr[i][k].SE = pr[pr[i][k - 1].FI][k - 1].SE + pr[i][k - 1].SE;
		}
	}
	}
	
	auto sl = [&](int l, int r) {
		int v = l;
		LL s = 0;
		dec(k, B) {
			if(pl[v][k].FI <= r) {
				s += pl[v][k].SE;
				v  = pl[v][k].FI;
				continue;
			}
		}
		s += (r - v + 1) * L[v][0];
		return s;
	};
	auto sr = [&](int l, int r) {
		int v = r;
		LL s = 0;
		dec(k, B) {
			if(pr[v][k].FI >= l) {
				s += pr[v][k].SE;
				v  = pr[v][k].FI;
				continue;
			}
		}
		s += (v - l + 1) * R[v][0];
		return s;
	};
	
	auto Q = in<int>();
	inc(q, Q) {
		auto [l, r] = tin<LL, LL>();
		LL sum = sl(l, r) + sr(l, r);
		LL len = r - l + 1;
		LL ans = - sum % len;
		if(ans <= 0) { ans += len; }
		out(ans);
	}
}


Measured memory_bytes: 141576