One-dimensional Game

Bogdan is playing a game. The game is one-dimensional. There are $n$ platforms located on the horizontal line. Bogdan can move between platforms. The $i$-th platform is a horizontal segment $[l_i, r_i]$. All segments are distinct.

Let's say that the platform $j$ is inside the platform $i$ if $l_i \le l_j$ and $r_j \le r_i$.

At the beginning of the game, Bogdan chooses the platform from which he will start his journey. Moving between platforms is dangerous and Bogdan tries to stay away from the danger, so he can move from the platform $i$ to the platform $j$ only if the platform $j$ is inside the platform $i$ and there is no other platform $k$ which is inside the platform $i$ and the platform $j$ is inside the platform $k$.

For each platform, Bogdan wants to know how many different paths he can take, starting from this platform and ending on any other. Two paths are different if there is a platform which is in one of the paths but not in the other one.

Help Bogdan count the number of paths from each platform. Since the number of paths can be very large, find it modulo $10^9 + 7$.

The first line contains the only integer $n$ ($1 \le n \le 3 \cdot 10^5$), the number of platforms.

The next $n$ lines contain the platforms' data. The $i$-th of these lines contains two integers $l_i$ and $r_i$ ($1 \le l_i \le r_i \le 10^9$), the ends of the $i$-th segment of the platform.

Print $n$ integers. The $i$-th integer must be equal to the number of different paths from the platform $i$, modulo $10^9 + 7$.