#include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

// Count elements in [A_begin, ..., A_{end-1}] which satisfy A_i < query
// Complexity: O(N log^2 N) for initialization, O(log^2 N) for each query
// Verified: cntLess <https://codeforces.com/contest/1288/submission/68865506>
struct CountLessThan
{
    using T = int;
    int N;
    int head;
    vector<vector<T>> x;
    inline void merge(int pos) {
        x[pos] = x[pos * 2 + 1];
        x[pos].insert(x[pos].end(), x[pos * 2 + 2].begin(), x[pos * 2 + 2].end());
        sort(x[pos].begin(), x[pos].end());
    }
    int _getless(int begin, int end, int pos, int l, int r, T query) const {
        if (r <= begin or l >= end) return 0;
        if (l >= begin and r <= end) return lower_bound(x[pos].begin(), x[pos].end(), query) - x[pos].begin();
        return _getless(begin, end, 2 * pos + 1, l, (l + r) / 2, query) + _getless(begin, end, 2 * pos + 2, (l + r) / 2, r, query);
    }
    int _getlesseq(int begin, int end, int pos, int l, int r, T query) const {
        if (r <= begin or l >= end) return 0;
        if (l >= begin and r <= end) return upper_bound(x[pos].begin(), x[pos].end(), query) - x[pos].begin();
        return _getlesseq(begin, end, 2 * pos + 1, l, (l + r) / 2, query) + _getlesseq(begin, end, 2 * pos + 2, (l + r) / 2, r, query);
    }
    CountLessThan() = default;
    CountLessThan(const vector<T> &vec) : N(vec.size()) {
        int N_tmp = 1; while (N_tmp < N) N_tmp <<= 1;
        x.resize(N_tmp*2), head = N_tmp - 1;
        for (int i = 0; i < N; i++) x[head + i] = {vec[i]};
        for (int i = head - 1; i >= 0; i--) merge(i);
    }
    int cntLess(int begin, int end, T query) const { return _getless(begin, end, 0, 0, (int)x.size() / 2, query); }
    int cntLesseq(int begin, int end, T query) const { return _getlesseq(begin, end, 0, 0, (int)x.size() / 2, query); }
    int cntMore(int begin, int end, T query) const {
        int tot = max(0, min(end, N) - max(begin, 0));
        return tot - cntLesseq(begin, end, query);
    }
    int cntMoreeq(int begin, int end, T query) const {
        int tot = max(0, min(end, N) - max(begin, 0));
        return tot - cntLess(begin, end, query);
    }

    friend ostream &operator<<(ostream &os, const CountLessThan &clt) {
        os << '[';
        for (int i = 0; i < clt.N; i++) os << clt.x[clt.head + i][0] << ',';
        os << ']';
        return os;
    }
};
int main()
{
    int N, Q;
    cin >> N >> Q;
    vector<int> C(N);
    cin >> C;
    vector<int> nxt(N, N), last(N + 1, N);
    IREP(i, N)
    {
        nxt[i] = last[C[i]];
        last[C[i]] = i;
    }
    CountLessThan st(nxt);
    while (Q--)
    {
        int l, r;
        cin >> l >> r;
        l--;
        cout << r - l - st.cntLess(l, r, r) << '\n';
    }
}


Measured memory_bytes: 97920