1 \(s / 64\) \(MB / 70\) points

Kile really liked Nikola's task with wizards and a wand (see task Elder ) so he decided to make his

own version. He imagined that instead of the 26 wizards there are \(N\) of them labeled with integers

from 1 to \(N\) and that \(M\) duels must be held among the wizards. It is possible that a duel between the

same pair of wizards will be held multiple times.

As in Nikola's task, if before the match the wand belonged to the loser, after the match the wand will

be assigned to the winner.

If we know in advance for each duel which pair of wizards will fight, as well as which of them will win

and if we can choose the order in which the duels will be held, then Kile wants to know in whose

hands the wand can end up in after all \(M\) duels.

In the beginning, the wand belongs to the wizard with the label 1.

In the sample tests totally worth 20% of points it will be true that 1 ≤ \(N\) , \(M\) ≤ 10.

The first line contains two integers \(N\) and \(M\) (1 ≤ \(N\) , \(M\) ≤ 100 000).
In the following \(M\) lines there are two numbers \(X\) {i} and \(Y\) will win} (1 ≤ \(Xi\) , \(Yi\) ≤ \(N\) , \(Xi\) ≠ \(Yi\) ). The wizard \(X\) _{i

the fight against wizard \(Y\) {i}{ }.

Print \(N\) characters in the first and only line. The character at the \(k\) ^{th}{ } position should be '1' if the wizard
labeled with \(k\) can rule over the wand after all \(M\) duels and '0' otherwise.

생성자가 기록되지 않았습니다.

출처 COCI 2018/2019 Contest 4