#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N;
vector<int> P;
int Q;
vector<int> L, R;

int mx[20][200'010];
int f[20][200'010];

int main() {
  for (; ~scanf("%d", &N); ) {
    P.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &P[i]);
      --P[i];
    }
    scanf("%d", &Q);
    L.resize(Q);
    R.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%d%d", &L[q], &R[q]);
      --L[q];
    }
    
    const int E = 31 - __builtin_clz(N);
    for (int i = 0; i < N; ++i) mx[0][i] = P[i];
    for (int e = 0; e < E; ++e) {
      for (int i = 0; i + (1 << (e + 1)) <= N; ++i) {
        mx[e + 1][i] = max(mx[e][i], mx[e][i + (1 << e)]);
      }
    }
    
    vector<int> ans(N, 0);
    memset(f, 0, sizeof(f));
    for (int q = 0; q < Q; ++q) {
// cerr<<COLOR("93")<<L[q]<<" "<<R[q]<<COLOR()<<endl;
      int l = L[q], r = R[q];
      int tail = P[--r];
      for (int e = 0; l < r; ++e) {
// cerr<<"e = "<<e<<", l = "<<l<<", r = "<<r<<", tail = "<<tail<<endl;
        assert(!((r - l) & ((1 << e) - 1)));
        if ((r - l) >> e & 1) {
          r -= (1 << e);
          ++f[e + 1][l];
          --f[e + 1][r];
          ++ans[tail = max(mx[e][r], tail)];
        } else {
          ++f[e + 1][l];
          --f[e + 1][r];
          ++ans[tail = max(tail, mx[e + 1][l])];
          l += (1 << (e + 1));
        }
      }
    }
    for (int e = 1; e <= E; ++e) {
      for (int i = 0; i + (1 << e) <= N; ++i) {
        ans[mx[e][i]] += f[e][i];
        f[e][i + (1 << e)] += f[e][i];
      }
// cerr<<"f["<<e<<"] = ";pv(f[e],f[e]+(N+1));
    }
    
    for (int a = 0; a < N; ++a) {
      printf("%d\n", ans[a]);
    }
  }
  return 0;
}