#D1974. Nested Segments
Nested Segments
Nested Segments
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
inputFormat
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.
outputFormat
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
样例
4
1 8
2 3
4 7
5 6
3
0
1
0