#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T &res) {
  char c;
  T flag = 1;
  while ((c = getchar()) < '0' || c > '9')
    if (c == '-') flag = -1;
  res = c - '0';
  while ((c = getchar()) >= '0' && c <= '9') res = res * 10 + c - '0';
  res *= flag;
}
const int maxn = 2e5 + 10;
int Max;
int ans[maxn], c[maxn << 1];
vector<int> vc;
struct Node {
  int l, r, index;
  friend bool operator<(Node a, Node b) { return a.r < b.r; }
} nd[maxn];
int getIndex(int v) {
  return lower_bound(vc.begin(), vc.end(), v) - vc.begin() + 1;
}
int lowbit(int x) { return x & -x; }
void add(int x, int v) {
  while (x <= Max) {
    c[x] += v;
    x += lowbit(x);
  }
}
int query(int x) {
  int ans = 0;
  while (x > 0) {
    ans += c[x];
    x -= lowbit(x);
  }
  return ans;
}
int main() {
  std::ios::sync_with_stdio(false);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> nd[i].l >> nd[i].r;
    nd[i].index = i;
    vc.push_back(nd[i].l);
    vc.push_back(nd[i].r);
  }
  sort(nd + 1, nd + n + 1);
  sort(vc.begin(), vc.end());
  vc.erase(unique(vc.begin(), vc.end()), vc.end());
  Max = vc.size();
  for (int i = 1; i <= n; i++) {
    ans[nd[i].index] = query(getIndex(nd[i].r)) - query(getIndex(nd[i].l) - 1);
    add(getIndex(nd[i].l), 1);
  }
  for (int i = 1; i <= n; i++) {
    cout << ans[i] << endl;
  }
  return 0;
}

### Prompt

Your task is to create a CPP solution to the following problem:

You are given n segments on a line. There are no ends of some segments that coincide. For each segment find the number of segments it contains.

Input

The first line contains a single integer n (1 ≤ n ≤ 2·105) — the number of segments on a line.

Each of the next n lines contains two integers li and ri ( - 109 ≤ li < ri ≤ 109) — the coordinates of the left and the right ends of the i-th segment. It is guaranteed that there are no ends of some segments that coincide.

Output

Print n lines. The j-th of them should contain the only integer aj — the number of segments contained in the j-th segment.

Examples

Input

4
1 8
2 3
4 7
5 6


Output

3
0
1
0


Input

3
3 4
1 5
2 6


Output

0
1
1

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T &res) {
  char c;
  T flag = 1;
  while ((c = getchar()) < '0' || c > '9')
    if (c == '-') flag = -1;
  res = c - '0';
  while ((c = getchar()) >= '0' && c <= '9') res = res * 10 + c - '0';
  res *= flag;
}
const int maxn = 2e5 + 10;
int Max;
int ans[maxn], c[maxn << 1];
vector<int> vc;
struct Node {
  int l, r, index;
  friend bool operator<(Node a, Node b) { return a.r < b.r; }
} nd[maxn];
int getIndex(int v) {
  return lower_bound(vc.begin(), vc.end(), v) - vc.begin() + 1;
}
int lowbit(int x) { return x & -x; }
void add(int x, int v) {
  while (x <= Max) {
    c[x] += v;
    x += lowbit(x);
  }
}
int query(int x) {
  int ans = 0;
  while (x > 0) {
    ans += c[x];
    x -= lowbit(x);
  }
  return ans;
}
int main() {
  std::ios::sync_with_stdio(false);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> nd[i].l >> nd[i].r;
    nd[i].index = i;
    vc.push_back(nd[i].l);
    vc.push_back(nd[i].r);
  }
  sort(nd + 1, nd + n + 1);
  sort(vc.begin(), vc.end());
  vc.erase(unique(vc.begin(), vc.end()), vc.end());
  Max = vc.size();
  for (int i = 1; i <= n; i++) {
    ans[nd[i].index] = query(getIndex(nd[i].r)) - query(getIndex(nd[i].l) - 1);
    add(getIndex(nd[i].l), 1);
  }
  for (int i = 1; i <= n; i++) {
    cout << ans[i] << endl;
  }
  return 0;
}

```