#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}


int main() {
  int N, K;
  cin >> N >> K;
  vector< int > X(N);
  cin >> X;

  vector< int > nxt(N);
  {
    int ptr = 0;
    for(int i = 0; i < N; i++) {
      while(ptr < N && X[ptr] - X[i] < K) ++ptr;
      nxt[i] = ptr;
    }
  }
  vector< int > pre(N);
  {
    int ptr = N - 1;
    for(int i = N - 1; i >= 0; i--) {
      while(ptr >= 0 && X[i] - X[ptr] < K) --ptr;
      pre[i] = ptr;
    }
  }

  auto latte = make_v< int >(20, N);
  auto latteS = make_v< int64 >(20, N);
  for(int i = 0; i < N; i++) {
    latte[0][i] = nxt[i];
    latteS[0][i] = nxt[i];
  }
  for(int i = 0; i + 1 < 20; i++) {
    for(int j = 0; j < N; j++) {
      if(latte[i][j] == N) {
        latte[i + 1][j] = N;
        latteS[i + 1][j] = latteS[i][j];
      } else {
        latte[i + 1][j] = latte[i][latte[i][j]];
        latteS[i + 1][j] = latteS[i][j] + latteS[i][latte[i][j]];
      }
    }
  }

  auto malta = make_v< int >(20, N);
  auto maltaS = make_v< int64 >(20, N);
  for(int i = 0; i < N; i++) {
    malta[0][i] = pre[i];
    maltaS[0][i] = pre[i] + 1;
  }
  for(int i = 0; i + 1 < 20; i++) {
    for(int j = 0; j < N; j++) {
      if(malta[i][j] == -1) {
        malta[i + 1][j] = -1;
        maltaS[i + 1][j] = latteS[i][j];
      } else {
        malta[i + 1][j] = malta[i][malta[i][j]];
        maltaS[i + 1][j] = maltaS[i][j] + maltaS[i][malta[i][j]];
      }
    }
  }

  int Q;
  cin >> Q;
  while(Q--) {
    int l, r;
    cin >> l >> r;
    --l, --r;
    int64 sum = 0;
    {
      int k = l;
      sum -= l;
      for(int i = 19; i >= 0; i--) {
        if(latte[i][k] <= r) {
          sum -= latteS[i][k];
          k = latte[i][k];
        }
      }
    }

    {
      int k = r;
      sum += r + 1;
      for(int i = 19; i >= 0; i--) {
        if(malta[i][k] >= l) {
          sum += maltaS[i][k];
          k = malta[i][k];
        }
      }
    }

    cout << sum << "\n";
  }
}

Measured memory_bytes: 101788