Balance Scale

There are $N$ objects, all of different weights, numbered 1 to $N$. For some pairs of objects you already measured on a balance scale which one is heavier, and those results are collected in a table. From that table you can sometimes work out the comparison for a pair you never measured, and sometimes you cannot.

Suppose there are 6 objects and the five measured results are $[1]>[2]$, $[2]>[3]$, $[3]>[4]$, $[5]>[4]$, $[6]>[5]$, where $[i]$ means the weight of object $i$. From $[2]>[3]$ and $[3]>[4]$ you get $[2]>[4]$. For objects 2 and 6, the table says nothing about which one is heavier. So object 2 has a known comparison against objects 1, 3, and 4, and an unknown comparison against objects 5 and 6. Object 4 has a known comparison against every other object.

The input never contradicts itself. Suppose $[3]>[1]$ were added to the example above. From $[1]>[2]$ and $[2]>[3]$ you derive $[1]>[3]$, which conflicts with the measured $[3]>[1]$. Such an input is never given.

Given the number of objects $N$ and the measured results for some pairs, write a program that prints, for each object, how many objects its comparison result is unknown against.

The first line contains the number of objects $N$. The second line contains the number of measured pairs $M$. Here $5 \le N \le 100$ and $0 \le M \le 2000$. Each of the next $M$ lines holds one measured result: two integers separated by a space, where the first object is heavier than the second.

Print the answers on $N$ lines. Line $i$ holds the number of objects whose comparison against object $i$ is unknown.