#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using VVbo = vector<Vbo>;
using VVV = vector<VV>;
using VVVll = vector<VVll>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using Pld = pair<ld, ld>;
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define rep(i, n) rep2(i, 0, n)
#define drep(i, n) drep2(i, n, 0)
#define all(a) (a).begin(), (a).end()
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
template<typename T> inline int sz(T &x) { return x.size(); }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<typename T> inline int count_between(vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)
inline int fLog2(const int x) { assert(x > 0); return 31-__builtin_clz(x); } // floor(log2(x))
inline int fLog2(const ll x) { assert(x > 0); return 63-__builtin_clzll(x); }
inline int cLog2(const int x) { assert(x > 0); return (x == 1) ? 0 : 32-__builtin_clz(x-1); } // ceil(log2(x))
inline int cLog2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64-__builtin_clzll(x-1); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
void fail() { puts("-1"); exit(0); }
// const int INF  = 1<<30;
// const ll INFll = 1ll<<62;
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
// const int MOD  = int(1e9)+7;
// const int MOD  = 998244353;


template<typename T>
struct FenwickTree {
  int n; vector<T> d;
  FenwickTree(int n = 0) : n(n), d(n+1) {}
  void add(int i, T a = 1) { for (++i; i <= n; i += i & -i) d[i] += a; }
  T _sum(int i) { T x = 0; for (; i > 0; i -= i & -i) x += d[i]; return x; }
  T sum(int l, int r) { return _sum(r) - _sum(l); } // [l, r)
  T operator[](const int i) { return sum(i, i+1); }
};


int main() {
  int n, q; cin >> n >> q;

  using Query = array<int, 3>;
  vector<Query> query;
  V pre(n, -1);
  rep(i, n) {
    int c; cin >> c;
    --c;
    if (pre[c] != -1) query.push_back({pre[c], i, -1});
    pre[c] = i;
  }
  rep(i, q) {
    int l, r; cin >> l >> r;
    --l;
    query.push_back({l, r, i});
  }

  sort(all(query), [&] (const Query &a, const Query &b) {
    if (a[0] != b[0]) return a[0] > b[0];
    else return a[2] < b[2];
  });

  FenwickTree<int> ft(n);
  V ans(q);

  for (const auto [l, r, i] : query) {
    if (i == -1) ft.add(r);
    else ans[i] = r - l - ft.sum(0, r);
  }
  
  cout << ans << '\n';
  return 0;
}


Measured memory_bytes: 20732