#include using namespace std; #ifdef DEBUG_ #include #else #define dump(...) #endif // clang-format off struct Fast{Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast; #define rep(i,n) for (int i=0; i<(int)n; ++i) #define rrep(i,a,n) for (int i=a; i<(int)n; ++i) #define out(msg) cout << (msg) << '\n' #define die(msg) do{ cout << (msg) << endl,exit(0); }while(0) #define el '\n' #define all(k) k.begin(), k.end() #define rall(k) k.rbegin(), k.rend() // const #define INFi 1 << 30 #define INFll 1LL << 60 #define MOD17 10'0000'0007 #define MOD98 9'9824'4353 // alias using ullint = unsigned long long int; using llint = long long int; template inline bool chmax(T& a, const T& b) { return ((a < b) ? (a = b, true) : false); } template inline bool chmin(T& a, const T& b) { return ((a > b) ? (a = b, true) : false); } // clang-format on using P = pair; bool compare(const P& a, const P& b) { if (a.second < b.second) return true; return false; } int main() { int n, q; cin >> n >> q; vector ai(n); rep(i, n) cin >> ai[i]; vector

vp; rep(i, n) vp.push_back({i + 1, ai[i]}); sort(all(vp), compare); map zekken; rep(i, n) { auto [idx, dist] = vp[i]; zekken[dist] = i + 1; } // dump(zekken); rep(_, q) { int x, y; cin >> x >> y; x--, y--; dump(x, y); dump(zekken[ai[x]], zekken[ai[y]]); int a = zekken[ai[x]]; int b = zekken[ai[y]]; if (a <= b) cout << 0 << el; else cout << a - b - 1 << el; } }