Chess Tournament

A friend of yours organizes an international chess championship. Players report their own match results to the jury, and the jury never confirms a report with the opponent. A player can therefore invent a match and report a win that never happened.

Chess is decided by skill, not by chance. A player with a higher skill level always beats a player with a lower one, and a game is a draw exactly when the two skill levels are equal. Nobody knows the skill level of any player.

Given the list of reported matches, decide whether the list is consistent. The list is inconsistent when at least one report can be shown to be false, that is, when no assignment of skill levels to players satisfies every report at once. Otherwise the list is consistent.

The first line contains two integers $N$ and $M$ ($2 \le N \le 50000$, $1 \le M \le 250000$), the number of players and the number of reported matches.

Each of the next $M$ lines contains an integer $K$, a symbol that is either = or >, and an integer $L$ ($0 \le K, L < N$). The integers $K$ and $L$ identify players. If the symbol is =, the game between $K$ and $L$ was a draw. If the symbol is >, then $K$ beat $L$.

At most one match is reported between any given pair of players. Every player takes part in at least one reported match.

Print a single line with a single word: consistent if every reported match can be true at the same time, and inconsistent if they cannot.