#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
template<class T> using graph=vector<vector<T>>;
template<class T> using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
constexpr int INF32=INT_MAX/2;
constexpr ll INF64=1LL<<60;
constexpr array<int,4> DX4={0,1,0,-1};
constexpr array<int,4> DY4={-1,0,1,0};
constexpr array<int,8> DX8={0,1,1,1,0,-1,-1,-1};
constexpr array<int,8> DY8={-1,-1,0,1,1,1,0,-1};
inline int popcnt(ll n){return __builtin_popcountll(n);}
template<class T> inline bool chmax(T& a,const T& b){return a<b?a=b,true:false;}
template<class T> inline bool chmin(T& a,const T& b){return b<a?a=b,true:false;}
#define rep(i,s,n) for(ll i=(ll)(s);i<(ll)(n);i++)
#define rrep(i,s,n) for(ll i=(ll)(s);i>=(ll)(n);i--)
void _main();
int main(){
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout<<fixed<<setprecision(16);
	_main();
}

template<class T,class C=less<T>>
class Compress{
	private:
		vector<T> v;

	public:
		Compress(){}

		void push(const T x){
			v.push_back(x);
		}

		void build(){
			sort(v.begin(), v.end(), C());
			v.erase(unique(v.begin(),v.end()),v.end());
		}

		size_t size() const {
			return v.size();
		}

		T nth(const int i) const {
			assert(0<=i && i<int(v.size()));
			return v[i];
		}

		int get(const T x) const {
			int ng=-1, ok=int(v.size())-1;
			while(1<ok-ng){
				int mid=(ok+ng)/2;
				if(!C()(v[mid],x)) ok=mid;
				else ng=mid;
			}
			return ok;
		}

		bool count(const T x) const {
			return nth(get(x))==x;
		}
};

void _main(){
	int N, Q; cin >> N >> Q;
	vector<ll> A(N); rep(i,0,N) cin >> A[i];

	Compress<ll> comp;
	rep(i,0,N) comp.push(A[i]);
	comp.build();

	while(Q--){
		ll x, y; cin >> x >> y; x--; y--;

		int ans = max(0, comp.get(A[x])-comp.get(A[y])-1);
		cout << ans << endl;
	}
}