#include using namespace std; typedef long long ll; typedef pair P; #define REP(i,n) for(int i=0;i> N >> T; vector

a(N); REP(i,N){ int x; cin >> x; a[i]=P(x,i); } sort(a.begin(),a.end()); vector v(N); REP(i,N){ v[a[i].second]=i+1; if(i>=1){ if(a[i].first==a[i-1].first) v[a[i].second]=v[a[i-1].second]; } } REP(i,N) cout << v[i] << ' '; cout << endl; while(T--){ int x,y; cin >> x >> y; x--; y--; if(v[x]<=v[y]) cout << 0 << endl; else cout << v[x]-v[y]-1 << endl; } return 0; }