#include <bits/stdc++.h>

#define len(s) (int)s.size()

using namespace std;
using ll = int64_t;
using ld = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;

const ll INF = 1e18;

const int MAXN = 1e5 + 11;
int n, q, a[MAXN], b[MAXN];
unordered_map<int, int> ids;
vector<int> st[MAXN * 4];

void build(int id, int l, int r)
{
    if (l == r)
    {
        st[id].push_back(b[l]);
    }
    else
    {
        int mid = (l + r) >> 1;
        build(id * 2, l, mid);
        build(id * 2 + 1, mid + 1, r);

        merge(st[id * 2].begin(), st[id * 2].end(),
              st[id * 2 + 1].begin(), st[id * 2 + 1].end(),
              back_inserter(st[id]));
    }
}

int query(int id, int l, int r, int u, int v, int k)
{
    if (v < l || r < u)
        return 0;
    if (u <= l && r <= v)
    {
        return (st[id].size() - (upper_bound(st[id].begin(), st[id].end(), k) - st[id].begin()));
    }

    int mid = (l + r) >> 1;
    return query(id * 2, l, mid, u, v, k) + query(id * 2 + 1, mid + 1, r, u, v, k);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    cin >> n >> q;

    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i];
    }

    for (int i = n; i >= 1; --i)
    {
        if (ids.count(a[i]) == 0)
            b[i] = 1e9;
        else
            b[i] = ids[a[i]];
        ids[a[i]] = i;
    }

    build(1, 1, n);

    while (q--)
    {
        int l, r;
        cin >> l >> r;
        cout << query(1, 1, n, l, r, r) << "\n";
    }
}