#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

long long mod_exp(long long b, long long e, long long m) {
    if (e > 0 && b == 0) return 0;
    long long ans = 1;
    b %= m;

    while (e > 0) {
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b * b) % m;
    }

    return ans;
}


int main()
{

    int Q;
    Q = 1;
    //cin >> Q;



    while (Q--) {
        int n,m;
        cin >> n>>m;
        vector<pair<int,int>>p(n);
        vector<int>w(n);
        map<int, int>mp;
        for (int i = 0; i < n; i++) {
            cin >> p[i].first; p[i].second = i;
            w[i] = p[i].first;
            mp[p[i].first]++;
        }
        sort(p.begin(), p.end());
       

        //cout << endl;
        vector<int>r(n);
        for (int i = 0; i < n; i++) {
            int j = i;
            r[p[i].second] = j;
            while (i<n-1&&p[i+1].first == p[j].first) {
                r[p[i].second] = j;
                i+=1;
                //cout << r[p[i-1].second] << " ";
            }
            
        }
        

        for (int i = 0; i < m; i++) {
            int a, b;
            cin >> a >> b;
            a--; b--;
            //cout << r[a] << " "<<r[b] << " ";
            int res = r[a] - r[b]-mp[w[b]];
            cout << max(res,0) << endl;
        }
    }
        return 0;
}