#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

#ifdef CPP17
template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}
#endif

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { 
        std::cin.tie(nullptr); 
        std::ios_base::sync_with_stdio(false); 
        std::cout << std::fixed << std::setprecision(30); 
    } 
} init_io; 
}
template <typename T>
T ceil_pow2(T bound) {
    T ret = 1;
    while (ret < bound) ret *= 2;
    return ret;
}
template <typename T>
T ceil_div(T a, T b) { return a / b + !!(a % b); }
#define CPP17


int main() {
    ll n, k;
    std::cin >> n >> k;
    vec<ll> xv(n + 2);
    const ll inf = 5e15;
    for (ll i = 1; i <= n; i++) std::cin >> xv[i];
    xv[0] = -inf - 10;
    xv[n + 1] = inf + 10;

    auto fdp = make_v<ll>(20, n + 2);
    fill_seq(fdp, [&](ll k, ll i) { return i; });
    auto fsum = fdp;
    auto bdp = fdp;
    auto bsum = fsum;

    {
        for (ll i = 1; i <= n; i++) {
            auto ite = std::lower_bound(ALL(xv), xv[i] + k);
            ll idx = std::distance(xv.begin(), ite);
            fdp[0][i] = idx;
            fsum[0][i] = i;
        }
        for (ll k = 0; k + 1 < 20; k++) for (ll i = 0; i < n + 2; i++) {
            ll nxt = fdp[k][i];
            fdp[k + 1][i] = fdp[k][nxt];
            fsum[k + 1][i] = fsum[k][i] + fsum[k][nxt];
        }
    }
    {
        for (ll i = 1; i <= n; i++) {
            auto ite = std::upper_bound(ALL(xv), xv[i] - k) - 1;
            ll idx = std::distance(xv.begin(), ite);
            bdp[0][i] = idx;
            bsum[0][i] = i + 1;
        }
        for (ll k = 0; k + 1 < 20; k++) for (ll i = 0; i < n + 2; i++) {
            ll nxt = bdp[k][i];
            if (nxt == i) continue;
            bdp[k + 1][i] = bdp[k][nxt];
            bsum[k + 1][i] = bsum[k][i] + bsum[k][nxt];
        }
    }

    ll q;
    std::cin >> q;
    vec<pll> qv(q);
    for (auto &[ l, r ] : qv) std::cin >> l >> r;
    xv.front() = 0;
    xv.back() = 0;

    // [l, r]
    auto go = [&](ll cur, ll l, ll r, const vvec<ll> &dp, const vvec<ll> &sum) {
        ll ret = 0;
        for (ll k = 20 - 1; 0 <= k; k--) {
            ll nxt = dp[k][cur];
            if (!(l <= nxt && nxt <= r)) continue;
            ret += sum[k][cur];
            cur = dp[k][cur];
        }
        return pll(ret, cur);
    };

    for (auto [ l, r ] : qv) {
        auto [ sum1, n1 ] = go(l, l, r, fdp, fsum);
        auto [ sum2, n2 ] = go(r, l, r, bdp, bsum);
        if (1 <= n1 && n1 <= n) sum1 += n1;
        if (1 <= n2 && n2 <= n) sum2 += n2 + 1;
        std::cout << sum2 - sum1 << "\n";
    }
    return 0;
}


Measured memory_bytes: 133124