#include <iostream>
#include <iosfwd>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cassert>
#include <cctype>
#include <climits>
#include <vector>
#include <bitset>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <deque>
#include <string>
#include <list>
#include <iterator>
#include <sstream>
#include <complex>
#include <fstream>
#include <functional>
#include <numeric>
#include <utility>
#include <algorithm>
// #include <unordered_set>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp> 

// using namespace __gnu_pbds;
using namespace std;

// template<class T> using OrderedSet = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// MACROS_BEGIN
#define CLEAR() cerr << endl;
#define LET(x, a) __typeof(a) x = a
#define FOREACH(it, v) for (LET(it, (v).begin()); it != (v).end(); ++it)
#define REPEAT(i, n) for (int i = 0; i < (n); ++i)
// MACROS_END

// GENERIC_UTILITIES_BEGIN
// template <class T> inline int size(const T& c) {return (int) c.size();}
inline long long two(int x) {return (1LL << (x));}

vector<string> split(string s, string delim) {
    s += delim[0];
    string tmp;
    vector<string> result;
    for (int i = 0; i < size(s); ++i) {
        if (delim.find(s[i]) == string::npos) {
            tmp.push_back(s[i]);
        }
        else {
            if (tmp != "") result.push_back(tmp);
            tmp.clear();
        }
    }
    return result;
}
// GENERIC_UTILITIES_END

// FAST_IO_BEGIN
// FAST_IO_END

// STANDARD_IO_BEGIN
#ifndef USING_FAST_IO
int readInt() {int N = -1; scanf("%d", &N); return N;}
double readDouble() {double D; scanf("%lf", &D); return D;}
string readString() {char buffer[1 << 20]; scanf("%s", buffer); return buffer;}
long long readLongLong() {long long N = -1; scanf("%lld", &N); return N;}
#endif // NOT DEFINED USING_FAST_IO
// STANDARD_IO_END


// OUTPUT_UTILITIES_BEGIN
template <class A, class B> ostream& operator << (ostream& o, const pair<A, B>& p);
template <class T> ostream& operator << (ostream& o, const vector<T>& v);
template <class A, class B> ostream& operator << (ostream& o, const map<A, B>& m);
template <class T> ostream& operator << (ostream& o, const set<T>& s);
template <class T> ostream& operator << (ostream& o, const queue<T>& q);
template <class T> ostream& operator << (ostream& o, const stack<T>& s);

template <class A, class B> ostream& operator << (ostream& o, const pair<A, B>& p) {
    o << "(" << p.first << "," << p.second << ")"; return o;
}

template <class T> ostream& operator << (ostream& o, const vector<T>& v) {
    o << "{"; bool first = true; FOREACH(it, v) { if (!first) o << ","; first = false; o << *it; } return o << "}";
}

template <class A, class B> ostream& operator << (ostream& o, const map<A, B>& m) {
    o << "{"; bool first = true; FOREACH(it, m) { if (!first) o << ","; first = false; o << *it; } return o << "}";
}

template <class T> ostream& operator << (ostream& o, const set<T>& s) {
    o << "{"; bool first = true; FOREACH(it, s) { if (!first) o << ","; first = false; o << *it; } return o << "}";
}

template <class T> ostream& operator << (ostream& o, const queue<T>& q) {
    o << "{"; bool first = true; queue<T> p = q; while (!p.empty()) { if (!first) o << ","; first = false; o << p.front(); p.pop(); } return o << "}";
}

template <class T> ostream& operator << (ostream& o, const stack<T>& s) {
    o << "{"; bool first = true; stack<T> r = s; while (!r.empty()) { if (!first) o << ","; first = false; o << r.top(); r.pop(); } return o << "}";
}
// OUTPUT_UTILITIES_END

// DEBUGGING_UTILITIES_BEGIN
// DEBUGGING SWITCH
#define PHOENIX_DEBUG

#ifdef PHOENIX_DEBUG
#define BUG(x) cerr << __LINE__ << ": " << #x << " = " << x << endl;
#else
#define BUG(...)
#endif
// DEBUGGING_UTILITIES_END

const double epsilon = 1e-8;
const int infinite    = 2000000000; // 2 * 10^9
const long long infiniteLL = 2000000000000000000LL; // 2 * 10^18
const long long modulo = 1000000007;

struct SegmentTree {
    int N;
    vector<int> tree;
 
    void initialize(int _N) {
        N = _N;
        tree.resize(4 * N, 0);
    }
 
    void update(int node, int b, int e, int idx, int val) {
        if (b > idx || e < idx) {
            return;
        } else if (b == e) {
            tree[node] = val;
        } else {
            int mid = (b + e) / 2, left = 2 * node, right = 2 * node + 1;
            update(left, b, mid, idx, val);
            update(right, mid + 1, e, idx, val);
            tree[node] = tree[left] + tree[right];
        }
    }
 
    int query(int node, int b, int e, int low, int high) {
        if (b > high || e < low) {
            return 0;
        } else if (b >= low && e <= high) {
            return tree[node];
        } else {
            int mid = (b + e) / 2, left = 2 * node, right = 2 * node + 1;
            return query(left, b, mid, low, high) + query(right, mid + 1, e, low, high);
        }
    }
 
    void update(int idx, int val) {
        update(1, 0, N - 1, idx, val);
    }
 
    int query(int low, int high) {
        return query(1, 0, N - 1, low, high);
    }
};

struct Task {
    int N, Q;
    vector<int> c;
    vector<int> answer;
    SegmentTree tree;
    vector< vector < pair<int, int> > > q;
    vector<int> position;

    void readInput() {
        N = readInt(), Q = readInt();
        c.resize(N);
        q.resize(N);

        for (int i = 0; i < N; ++i) {
            c[i] = readInt() - 1;
        }

        for (int i = 0; i < Q; ++i) {
            int L = readInt() - 1, R = readInt() - 1;
            q[R].push_back({L, i});
        }

        answer.resize(Q);
        tree.initialize(N);
    }

    void solve() {
        position.resize(N, -1);

        for (int R = 0; R < N; ++R) {
            tree.update(R, 1);

            if (position[c[R]] != -1) {
                tree.update(position[c[R]], 0);
            }

            position[c[R]] = R;

            for (pair<int, int> p : q[R]) {
                int L = p.first, idx = p.second;
                answer[idx] = tree.query(L, R);
            }
        }

        for (int i = 0; i < Q; ++i) {
            printf("%d\n", answer[i]);
        }
    }

    void perform() {
        readInput();
        solve();
    }
};

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    Task task;
    task.perform();

    return 0;
}

// Powered by PhoenixAI


Measured memory_bytes: 39124