#define MOD_TYPE 1

#pragma region Macros
#include <bits/stdc++.h>
using namespace std;

#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
//constexpr ll MOD = 1;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

inline void init_main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(30) << setiosflags(ios::fixed);
}
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;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

template <typename T>
struct BIT
{
  int n;
  vector<T> dat;

  BIT() {}
  BIT(int n_) : n(n_), dat(n_, 0) {}

  // 0-indexed
  void add(int i, T x)
  {
    i++;
    while (i <= n)
    {
      dat[i - 1] += x;
      i += i & -i;
    }
  }

  // [0, i)
  T sum(int i)
  {
    T res = 0;
    while (i > 0)
    {
      res += dat[i - 1];
      i -= i & -i;
    }
    return res;
  }

  // 0-indexed
  T get(int i) { return sum(i + 1) - sum(i); }

  // [l, r)
  T sum(int l, int r) { return sum(r) - sum(l); }
};

void solve()
{
  int n, q;
  cin >> n >> q;
  vector<int> c(n);
  rep(i, n)
  {
    cin >> c[i];
    c[i]--;
  }
  vector<tuple<int, int, int>> query(q);
  rep(i, q)
  {
    int a, b;
    cin >> a >> b;
    a--;
    query[i] = MT(b, a, i);
  }
  sort(all(query));
  int ri = 0;
  BIT<int> bit(n);
  vector<int> prepos(n, -1);
  vector<int> ans(q);
  for (auto [r, l, qi] : query)
  {
    while (ri < r)
    {
      if (prepos[c[ri]] != -1)
        bit.add(prepos[c[ri]], -1);
      bit.add(ri, 1);
      prepos[c[ri]] = ri;
      ri++;
    }
    ans[qi] = bit.sum(l, r);
  }
  rep(i, q) cout << ans[i] << "\n";
}

int main()
{
  init_main();
  solve();
}


Measured memory_bytes: 17404