Crayfish

There is a pond where $n$ turtles live. The pond also has $n$ houses, numbered from $1$ to $n$, and exactly one turtle lives in each house. A traveling crayfish, who is a friend of every turtle, is coming to the pond and will stay in one of the houses. The crayfish wants to pick a house from which it can visit as many friends as possible.

Visiting a friend means traveling from the house where the crayfish is staying to that friend's house and then coming back. The crayfish does not count the turtle in whose house it stays.

The crayfish moves between houses along one-way routes, following these rules:

1. The crayfish moves only along the given routes.
2. Every route is one-way and joins two different houses. Several routes may join the same pair of houses.
3. The crayfish travels either forward or backward. Standing in house $A$ and moving forward, it can go to house $B$ if there is a route from $A$ to $B$. Moving backward, it can go from house $A$ to house $B$ if there is a route from $B$ to $A$.
4. Some routes are special. Immediately after traversing a special route, the crayfish reverses its direction: forward becomes backward and backward becomes forward. The crayfish can change direction only in this way.
5. At the start of a trip the crayfish is moving backward. Passing through a friend's house does not change its direction. At the end of the trip the crayfish must again be moving backward (so if the last route it uses is special, it must be moving forward just before entering that route).

Write a program that reads the routes of the pond and, for each house, prints how many friends the crayfish could visit if it stayed in that house.

The first line contains two integers $n$ and $m$ ($1 \le n \le 10000$, $1 \le m \le 100000$): the number of houses and the number of routes. Each of the next $m$ lines describes one route with three integers $a$, $b$ and $s$ ($1 \le a, b \le n$, $a \ne b$, $s \in \{0, 1\}$). Here $a$ is the starting house and $b$ is the ending house of the route, and the route is special if and only if $s = 1$.

Print exactly $n$ lines. Line $i$ must contain a single integer: the number of friends the crayfish could visit if it stayed in house $i$.

The figure below illustrates a pond with five houses and five routes.

If the crayfish stays in house $1$, it can visit houses $2$, $3$ and $4$. Staying in house $2$, it can visit houses $3$, $4$ and $5$; staying in house $3$, houses $2$, $4$ and $5$; staying in house $4$, houses $2$, $3$ and $5$. Staying in house $5$, it can visit none of its friends.