#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <cmath> 
#include <climits>
#include <functional>
#include <iomanip>
#include <limits>
#include <cassert>
#include <random>
#include <complex>
#include <numeric>
#include <regex>
#include <list>
#include <ctime> 

using namespace std;

#define ll long long
#define ull unsigned long long
#define ld  long double
typedef vector<long long> vll;

using LL = long long; using ULL = unsigned long long;
using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>;
using VL = vector<LL>; using VVL = vector<VL>; using VVVL = vector<VVL>;
using VB = vector<bool>; using VVB = vector<VB>; using VVVB = vector<VVB>;
using VD = vector<double>; using VVD = vector<VD>; using VVVD = vector<VVD>;
using VC = vector<char>; using VS = vector<string>; using VVC = vector<VC>;
using PII = pair<int,int>; using PLL = pair<LL,LL>; using PDD = pair<double,double>; using PIL = pair<int,LL>;
using MII = map<int,int>; using MLL = map<LL,LL>;
using SI = set<int>; using SL = set<LL>;
using MSI = multiset<int>; using MSL = multiset<LL>;
template<class T> using MAXPQ = priority_queue<T>;
template<class T> using MINPQ = priority_queue< T, vector<T>, greater<T> >;

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
#define PI  3.14159265358979323846

#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(e, v) for(auto &e : v)
#define RITR(it, v) for(auto it = (v).rbegin(); it != (v).rend(); ++it)
#define ALL(v) v.begin(),v.end()

vector<ll> x8={1,1,1,0,0,-1,-1,-1},y8={1,0,-1,1,-1,1,0,-1};
int dx4[4]={1,-1,0,0}, dy4[4]={0,0,1,-1};

/*
memo
-uf,RMQ(segtree),BIT,BIT2,SegTree,SegTreeLazy
-isprime,Eratosthenes,gcdlcm,factorize,divisors,modpow,moddiv(modpow必要)
nCr(+modnCr,inverse,extend_euclid.powmod),tobaseB,tobase10
-dijkstra,Floyd,bellmanford,sccd,topological,treediamiter
-compress1,compress2,rotate90

-co,ci,fo1,fo2,fo3,fo4
-bitsearch,binaryserach
-bfs(vis.assign忘れるな)
-SegTreedec,SegTreeLazydec
*/

template <typename X>
struct SegTree{
    using FX = function<X(X,X)>; //Xを2つ受け取りXを返す関数の型
    long long n,N;
    FX fx; 
    X ex;
    vector<X> dat;

    //要素数N,二項演算fx,単位元ex;
    SegTree(long long _n, FX _fx, X _ex){
        init(_n, _fx, _ex);
    }

    void init(long long _n, FX _fx, X _ex){
        N = _n, fx = _fx; ex = _ex;
        long long x = 1;
        while(_n > x) x *= 2;
        n = x;
        dat.assign(n*2,_ex);
    }

    //i番目の要素にアクセス(0-indexed),O(1)
    X operator[](long long i){return dat[n+i];}
    X get(long long i){return dat[n+i];}

    //i番目の要素をxにアップデート(0-indexed),O(logN)
    void set(long long i, X x){
        i += n;
        dat[i] = x;
        while(i >>= 1){
            dat[i] = fx(dat[2*i],dat[2*i+1]);
        }
    }

    //[l,r)で二項演算を作用した結果(0-indexed),O(logN)
    X prod(long long l, long long r){
        X vleft = ex, vright = ex;
        for(long long left = l+n, right = r+n; left < right; left >>= 1, right >>= 1){
            if(left & 1) vleft = fx(vleft,dat[left++]);
            if(right & 1) vright = fx(vright,dat[--right]);
        }
        return fx(vleft,vright);
    }
    //[0,N)まで二項演算を作用,O(1)
    X all_prod() {return dat[1];}

    //x=prod(l,r),f(x)=trueとなる最大のrを求める(f(ex)=true, 0-indexed),O(logN)
    long long max_right(const function<bool(X)> f, long long l = 0){
        if(l == N) return N;
        l += n;
        X sum = ex;
        do{
            while(l % 2 == 0) l >>= 1;
            if(!f(fx(sum,dat[l]))){
                while(l < n){
                    l = l * 2;
                    if(f(fx(sum,dat[l]))){
                        sum = fx(sum,dat[l]);
                        l++;
                    }
                }
                return l - n;
            }
            sum = fx(sum,dat[l]);
            l++;
        }while((l & -l) != l);
        return N;
    }
  
    //x=prod(l,r),f(x)=trueとなる最小のlを求める(f(ex)=true, 0-indexed),O(logN)
    long long min_left(const function<bool(X)> f, long long r = -1){
        if(r == 0) return 0;
        if(r == -1) return N;
        r += n;
        X sum = ex;
        do{
            r--;
            while(r > 1 && (r % 2)) r >>= 1;
            if(!f(fx(dat[r],sum))){
                while(r < n){
                    r = r * 2 + 1;
                    if(f(fx(dat[r],sum))){
                        sum = fx(dat[r],sum);
                        r--;
                    }
                }
                return r + 1 - n;
            }
            sum = fx(dat[r],sum);
        }while((r & -r) != r);
        return 0;
    } 
};


int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    ll N,Q; cin >> N >> Q;
    VL a(N); for(ll i = 0; i < N; i++) cin >> a[i];

    VL b = a;
    sort(ALL(b));
    unique(ALL(b));
    map<ll,ll> mp;
    for(ll i = 0; i < b.size(); i++){
        mp[b[i]]=i+1;
    }
    VL c(N);
    for(ll i = 0; i < N; i++){
        c[i] = mp[a[i]];
        //cout << c[i] << " ";
    }

    auto fx = [](ll x1, ll x2) -> ll { return x1+x2; }; // 二項演算(RMQになってるので書き換える);
    ll ex = 0; // 単位元(fxに応じて書き換える);
    SegTree<ll> seg(N+1, fx, ex); //<ll> (要素数, 二項演算, 単位元);
    VL sum(N+1);
    for(ll i = 0; i < N; i++){
        seg.set(c[i],seg[c[i]]+1);
        sum[c[i]]++;
    }

    for(ll i = 0; i < N; i++){
        sum[i+1] += sum[i];
    }


    ll x,y;
    for(ll i = 0; i < Q; i++){
        cin >> x >> y;
        x--,y--;
        if(c[x] <= c[y]){
            cout << 0 << endl;
            continue;
        }
        ll res = sum[c[x]]-sum[c[y]+1];
        cout << res << endl;
    }
    
}