#define _USE_MATH_DEFINES
#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repd(i, n) for (int i = (n)-1; i >= 0; --i)
#define repds(i, n) for (int i = (n); i > 0; --i)
#define loop(i, x, n) for (int i = (x); i < (n); ++i)
#define loops(i, x, n) for (int i = (x); i <= (n); ++i)
#define loopd(i, x, n) for (int i = (x); i > (n); --i)
#define loopds(i, x, n) for (int i = (x); i >= (n); --i)
#define itrep(i, a) for (auto i = begin(a); i != end(a); ++i)
#define itrepd(i, a) for (auto i = rbegin(a); i != rend(a); ++i)
#define each(i, x) for (auto &&i : x)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(a) ((int)a.size())
#define pow2(n) (n * n)
#define int ll
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
template <class T>
using p_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr ll inf = static_cast<ll>(1e18);
constexpr int iinf = static_cast<int>(1e9);
constexpr double dinf = 1e10;
constexpr ld ldinf = 1e18;
constexpr double eps = 1e-8;
ll mod = static_cast<ll>(1e9 + 7);
template <class T, class... Args>
constexpr void mins(T &a, Args... args) { a = min<T>({a, args...}); }
template <class T, class... Args>
constexpr void maxs(T &a, Args... args) { a = max<T>({a, args...}); }
template <class F>
class FixPoint : private F {
public:
    explicit constexpr FixPoint(F &&f) : F(std::forward<F>(f)) {}
    template <class... Args>
    constexpr decltype(auto) operator()(Args &&... args) const { return F::operator()(*this, std::forward<Args>(args)...); }
};
template <class F>
constexpr decltype(auto) funcs(F &&f) { return FixPoint<F>{std::forward<F>(f)}; }
template <class T>
std::vector<T> vecs(int n, T &&val) { return std::vector<T>(std::forward<int>(n), std::forward<T>(val)); }
template <class... Args>
decltype(auto) vecs(int n, Args &&... args) { return std::vector<decltype(vecs(std::forward<Args>(args)...))>(std::forward<int>(n), vecs(std::forward<Args>(args)...)); }
template <class V, class T>
void fill(V &x, const T &val) { x = val; }
template <class V, class T>
void fill(vector<V> &vec, const T &val) {
    for (auto &&v : vec)
        fill(v, val);
}

template <typename T>
class BIT {
public:
    BIT(int n = 0) : n(n), d(n + 1) {}
    void add(int i, T x) {
        for (i++; i <= n; i += i & -i)
            d[i] += x;
    }
    T sum(int i) {
        T x = 0;
        for (i++; i; i -= i & -i)
            x += d[i];
        return x;
    }

private:
    int n;
    vector<T> d;
};

void solve() {
    int n, q;
    cin >> n >> q;
    vector<int> c(n);
    rep(i, n) cin >> c[i];

    vector<pair<pair<int, int>, int>> lr(q);
    rep(i, q) {
        cin >> lr[i].first.first >> lr[i].first.second;
        --lr[i].first.first, --lr[i].first.second;
        lr[i].second = i;
    }

    vector<int> before(n + 1, -1);
    vector<pair<int, int>> pos;
    rep(i, n) {
        if (before[c[i]] != -1) {
            pos.emplace_back(before[c[i]], i);
        }
        before[c[i]] = i;
    }

    sort(rall(lr));
    sort(rall(pos));
    BIT<int> bit(n + 1);
    vector<int> ans(q);
    int idx = 0;
    rep(i, q) {
        while (idx < sz(pos) && pos[idx].first >= lr[i].first.first) {
            bit.add(pos[idx].second, 1);
            ++idx;
        }
        ans[lr[i].second] = lr[i].first.second - lr[i].first.first + 1 - bit.sum(lr[i].first.second);
    }

    rep(i, q) cout << ans[i] << '\n';
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    solve();
    cout.flush();
    return 0;
}

Measured memory_bytes: 38380