#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii ;
typedef pair<ll, ll> pll ;
typedef vector<pii> vii ;
typedef vector<int> veci ;
typedef vector<pll> vll ;
typedef vector<ll> vecll;
// find_by_order order_of_key
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define Mp make_pair
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define set_dec(x) cout << fixed << setprecision(x);
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb lower_bound
#define ub upper_bound
#define for1(n) for(int i=1;i<=n;i++)
#define for0(n) for(int i=0;i<n;i++)
#define forn(n) for(int i=n;i>0;i--)
#define pq priority_queue <pii, vector<pii>, greater<pii>>
ll inf=1e18;
const int N=1<<19;
int n,q,lbd;
vector<pii>vecc[N];
ll pre[N],ans[N];
ll seg[N*2],lz[N*2],A[N],d;
void shift(int l,int r,int v){
if(r-l==1)return;
int mid=(l+r)>>1;
seg[v<<1]+=lz[v]*(mid-l);
seg[v<<1|1]+=lz[v]*(r-mid);
lz[v<<1]+=lz[v];
lz[v<<1|1]+=lz[v];
lz[v]=0;
}
void build(int l=1,int r=n+1,int v=1){
if(r-l==1){
seg[v]=A[l];
return;
}
int mid=(l+r)>>1;
build(l,mid,v<<1);
build(mid,r,v<<1|1);
seg[v]=seg[v<<1]+seg[v<<1|1];
}
void upd(int lx,int rx,ll x,int l=1,int r=n+1,int v=1){
if(lx>=r || rx<=l)return;
if(lx<=l && r<=rx){
seg[v]+=1ll*x*(r-l);
lz[v]+=x;
return;
}
shift(l,r,v);
int mid=(l+r)>>1;
upd(lx,rx,x,l,mid,v<<1);
upd(lx,rx,x,mid,r,v<<1|1);
seg[v]=seg[v<<1]+seg[v<<1|1];
}
ll get(int lx,int rx,int l=1,int r=n+1,int v=1){
if(lx>=r || rx<=l)return 0;
if(lx<=l && r<=rx)return seg[v];
shift(l,r,v);
int mid=(l+r)>>1;
return get(lx,rx,l,mid,v<<1)+get(lx,rx,mid,r,v<<1|1);
}
ll gett(int i){
if(i==0)return -inf;
return get(i,i+1);
}
int main(){
fast_io
cin>>n>>d;
for1(n)cin>>A[i];
for1(n)pre[i]=pre[i-1]+A[i];
build();cin>>q;
for1(q){
int l,r;cin>>l>>r;
vecc[r].pb({l,i});
}
vector<int>vec;vec.pb(0);
for1(n){
// cout<<i<<":\n";
while(1){
int j=vec.back();
ll x=gett(j),y=gett(j+1);
if(y<0)lbd=max(lbd,j+1);
// cout<<"!"<<j<<endl;
if(x<=y)break;
vec.pop_back();
ll t=y/d*d+x%d;
if(t>y)t-=d;
upd(vec.back()+1,j+1,-(x-t));
}
// cout<<"1:"<<gett(1)<<endl;
vec.pb(i);
// for(pii p:vecc[i]){
// cout<<p.S<<" "<<p.F<<":"<<pre[i]-pre[p.F-1]<<" "<<get(p.F,i+1)<<endl;
// }
for(pii p:vecc[i])ans[p.S]=((p.F<=lbd || gett(p.F)<0) ? -1:(pre[i]-pre[p.F-1]-get(p.F,i+1))/d);
}
for1(q)cout<<ans[i]<<endl;
}
