//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(unordered_set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }
#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'
const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353;
void SetIO(string str = "") {
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
else {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
void FastIO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
const int N = 1e6 + 10, M = 2e7 + 10;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
ll binpow(ll a, ll b, ll m) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % m;
}
b >>= 1;
a = (a * a) % m;
}
return res;
}
__int128_t gcd(__int128_t a, __int128_t b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
__int128_t lcm(__int128_t a, __int128_t b) {
return a / gcd(a, b) * b;
}
int n, q, sq, a[N], answ, ans[N];
unordered_map<int, int> mp;
struct QRY {
int l, r, id;
};
bool cmp(QRY A, QRY B) {
if(A.l / sq == B.l / sq){
return A.r < B.r;
}
return A.l / sq < B.l / sq;
}
void add(int i) {
mp[a[i]]++;
if (mp[a[i]] == 2) answ++;
else if (mp[a[i]] - 1 == 2) answ--;
}
void remove(int i) {
mp[a[i]]--;
if (mp[a[i]] == 2) answ++;
else if (mp[a[i]] + 1 == 2) answ--;
}
void solve(int tc) {
cin >> n >> q;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
sq = sqrt(n);
mp.reserve(4 * n);
vector<QRY> qrs;
for (int i = 1; i <= q; i++) {
int l, r;
cin >> l >> r;
qrs.push_back({ l, r, i });
}
sort(all(qrs), cmp);
int L = qrs[0].l, R = qrs[0].r;
for(int i = L; i <= R; i++){
add(i);
}
ans[qrs[0].id] = answ;
for (int i = 1; i < q; i++) {
auto [l, r, id] = qrs[i];
while (L >= l) {
add(--L);
}
while (R <= r) {
add(++R);
}
while (L < l) {
remove(L++);
}
while (R > r) {
remove(R--);
}
ans[id] = answ;
}
for (int i = 1; i <= q; i++) {
cout << ans[i] << endl;
}
}
void precalc() {
}
int main() {
// SetIO("teamwork");
FastIO();
int test_case = 1;
// cin >> test_case;
precalc();
int cnt = 1;
while (test_case--) {
solve(cnt++);
}
return 0;
}
