#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;
template<class T> bool ckmin(T& a, T b) { return b < a ? a = b, true : false; }
template<class T> bool ckmax(T& a, T b) { return a < b ? a = b, true : false; }
const int N = 3e5 + 7;
int a[N];
ll get(vector<int> v) {
int n = v.size();
ll ans = 0;
for (int i = 0; i < n; ++i) {
set<int> s;
for (int j = i; j < n; ++j) {
s.insert(v[j]);
ans += s.size();
}
}
return ans;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int n, q; cin >> n >> q;
for (int i = 1; i <= n; ++i) cin >> a[i];
for (int i = 1; i <= q; ++i) {
int l, r; cin >> l >> r;
vector<int> v;
for (int j = l; j <= r; ++j) v.push_back(a[j]);
sort(v.begin(), v.end());
vector<int> rv = v;
reverse(rv.begin(), rv.end());
ll ans = min(get(v), get(rv));
cout << ans << "\n";
}
}
