/* #region Head */

// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

/* #region CoordCompress1D */

// 1次元座圧
class CoordCompress1D {
    um<ll, ll> coord2zipped; // キーが座標値
    vll zipped2coord;        // 各要素が座標値
    ll sz;

  public:
    CoordCompress1D() {}
    CoordCompress1D(vll coords) {
        sort(ALL(coords));
        UNIQ(coords);
        sz = SIZE(coords);
        zipped2coord = coords;
        REP(i, 0, sz) coord2zipped[coords[i]] = i;
    }
    // 座標の圧縮（コンストラクタに与えた座標限定）
    ll zip(ll coord) { return coord2zipped[coord]; }
    ll unzip(ll zipped) { return zipped2coord[zipped]; }

    // coord 以上の最小の座標値を返す
    ll coord_geq(ll coord) {
        auto it = lower_bound(ALL(zipped2coord), coord);
        if (it != zipped2coord.end()) return *it;
        return INF;
    }

    // coord より大きいの最小の座標値を返す
    ll coord_gt(ll coord) {
        auto it = upper_bound(ALL(zipped2coord), coord);
        if (it != zipped2coord.end()) return *it;
        return INF;
    }

    // coord 以下の最小の座標値を返す
    ll coord_leq(ll coord) {
        auto rit = lower_bound(zipped2coord.rbegin(), zipped2coord.rend(), coord,
                               [](ll const lhs, ll const rhs) { return lhs > rhs; });
        if (rit != zipped2coord.rend()) return *rit;
        return -INF;
    }

    // coord 未満の最小の座標値を返す
    ll coord_lt(ll coord) {
        auto rit = upper_bound(zipped2coord.rbegin(), zipped2coord.rend(), coord,
                               [](ll const lhs, ll const rhs) { return lhs > rhs; });
        if (rit != zipped2coord.rend()) return *rit;
        return -INF;
    }

    ll size() { return sz; }
};

/* #endregion */

/* #region BIT */

template <class T> struct BinaryIndexedTree {
    vector<T> data;

    BinaryIndexedTree(int sz) { data.assign(++sz, 0); }

    T sum(int k) {
        T ret = 0;
        for (++k; k > 0; k -= k & -k) ret += data[k];
        return (ret);
    }

    void add(int k, T x) {
        for (++k; k < SIZE(data); k += k & -k) data[k] += x;
    }
};

/* #endregion */

vc<int> kindcnt(int n, int q, vll &seq, vc<int> &left, vc<int> &right) {
    using Query = tuple<int, int, int>;
    vc<Query> queries;
    REP(i, 0, q) queries.emplace_back(right[i], left[i], i);
    sort(ALL(queries)); // R の昇順でソート

    // lastAppeared[x] : （圧縮後の）値 x が最後に出現した位置
    CoordCompress1D cc(seq);
    vc<int> lastAppeared(cc.size(), -1);

    BinaryIndexedTree<int> bit(n); // 「ある値が最後に出現した」位置が 1 になる

    vc<int> ret(q);

    ll s = -1;
    REP(i, 0, q) {
        auto [rq, lq, idx] = queries[i];
        // 右端の位置 R が右に伸びたら、それぞれについて lastAppeared[a[R]] = R と更新
        // それに合わせて、対応する BIT の位置に -1, +1 する。+1 を右に移動するイメージ。
        // dump(rq, lq);
        REPM(j, s + 1, rq) {
            ll needle = cc.zip(seq[j]);
            ll oldidx = lastAppeared[needle];
            if (oldidx >= 0) bit.add(oldidx, -1);
            bit.add(j, 1);
            lastAppeared[needle] = j;
        }
        s = rq;
        ret[idx] = bit.sum(rq) - bit.sum(lq - 1);
    }

    return ret;
}

// Problem
void solve() {
    ll n, q;
    cin >> n >> q;

    vll c(n);
    cin >> c;
    vc<int> l(q), r(q);
    REP(i, 0, q) {
        cin >> l[i] >> r[i];
        --l[i], --r[i];
    }

    vc<int> ret = kindcnt(n, q, c, l, r);
    REP(i, 0, q) cout << ret[i] << endl;
}

// entry point
int main() {
    solve();
    return 0;
}


Measured memory_bytes: 46268