#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;

typedef
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> orderedSet;

#define pb push_back
#define F first
#define S second
#define all(a) (a).begin(), (a).end()

#define for1(i0, l0, r0) for (int i0 = l0; i0 < r0; ++i0)
#define for2(i0, l0, r0) for (int i0 = l0; i0 <= r0; ++i0)
#define forn(i0, n0) for (int i0 = 0; i0 < n0; ++i0)
#define forn1(i0, n0) for (int i0 = 1; i0 < n0; ++i0)
#define forr(i0, n0) for (int i0 = n0; i0 >= 0; --i0)
#define forr1(i0, r0, l0) for (int i0 = r0; i0 > l0; --i0)
#define forr2(i0, r0, l0) for (int i0 = r0; i0 >= l0; --i0)

#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define relaxMax(a, b) a = max(a, b)
#define relaxMin(a, b) a = min(a, b)

typedef long double ld;
#define ui unsigned int
#define ull unsigned long long

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<ld> vld;
typedef vector<bool> vb;
typedef vector<string> vs;

typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pdd> vpdd;

typedef vector<vi> vvi;
typedef vector<vd> vvd;
typedef vector<vll> vvll;
typedef vector<vb> vvb;

#define vpss vector<pss>
#define vvs vector<vs>
#define vvpii vector<vpii>
#define vvpll vector<vpll>
#define vpt vector<pt>
#define vvvi vector<vvi>
#define vsi vector<set<int>>
#define ss second
#define ff first

#define printvi(arr) for (int x0 : arr) cout << x0 << ' '; cout << '\n';
#define printvll(arr) for (ll x0 : arr) cout << x0 << ' '; cout << '\n';
#define printpair(pair0) cout << pair0.F << ' ' << pair0.S << '\n';
#define printvp(arr) for (auto pair0 : arr) printpair(pair0);
#define initArray(arr, N0, X0) memset(arr, X0, N0 * sizeof(int))
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void init() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //cout.precision(16);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
}

const int sz = 1 << 19;
vvi t(2 * sz);

int query(int v, int vl, int vr, int l, int r, int x) {
    if (vl > r || l > vr) return 0;
    if (vl >= l && vr <= r) {
        if (t[v][0] > x)
            return 0;
        int lt = 0, rt = t[v].size() - 1;
        while (lt < rt){
            int m = (lt + rt + 1) >> 1;
            if (t[v][m] > x) rt = m - 1; else lt = m;
        }
        return lt + 1;
    }
    int vm = (vl + vr) >> 1;
    return query(v * 2 + 1, vl, vm, l, r, x) + query(v * 2 + 2, vm + 1, vr, l, r, x);
}

void solve() {
    int n, q;
    cin >> n >> q;
    vi a(n), L(n, -1), last(n, -1);
    forn(i, n) {
        cin >> a[i];
        a[i]--;
        L[i] = last[a[i]];
        last[a[i]] = i;
    }
    forn(i, n) t[i + sz - 1].pb(L[i]);
    forr(i, sz - 2) {
        for (int x : t[2 * i + 1]) t[i].pb(x);
        for (int x : t[2 * i + 2]) t[i].pb(x);
        Sort(t[i]);
    }
    forn(i, q) {
        int l, r;
        cin >> l >> r;
        l--, r--;
        cout << query(0, 0, sz - 1, l, r, l - 1) << '\n';
    }
}

bool multitest = false;

int main() {
    init();
    int t = 1;
    if (multitest) cin >> t;
    forn(i, t) solve();
}

Measured memory_bytes: 97200