// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
#define int long long
#define endl "\n"
#define fi first
#define se second
const int M=998244353;
const int inf = 1e14;
const int LOG=20;
const int N=3e5+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;
void solve()
{
cin >> n >> x;
vector<int>a(n+1);
vector<int>pr0(n+1);
vector<int>pr1(n+1);
vector<int>cn(n+1);
for (int i=1;i<=n;i++){
cin >> a[i];
pr0[i]=pr0[i-1];
if (a[i]==0){
pr0[i]=i;
}
pr1[i]=pr1[i-1];
if (a[i]==1){
pr1[i]=i;
}
cn[i]=cn[i-1]+(a[i]==1);
}
cin >> q;
for (int o=0;o<q;o++){
cin >> l >> r;
if (pr1[pr0[r]]<l){
cout << 0 << endl;
}
else if(x==1){
cout << cn[pr1[pr0[r]]]-cn[l-1] << endl;
}
else{
cout << -1 << endl;
}
}
}
signed main()
{
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
cout << fixed << setprecision(9);
// int t=1;
// cin >> t;
for (int _=1;_<=t;_++){
solve();
q++;
}
}
