Cycles
======

Your program should read a finite-state automaton (without weights)
from standard input. The automaton can be nondeterministic and can
contain epsilon-transitions.

Your program should check whether the automaton contains a cycle (of any length).

If so, the following line should be written on the standard output:

TAK

otherwise:

NIE

("TAK" and "NIE" are "YES" and "NO" in Polish, these are used for
compatibility with further tasks.)

NOTE 1. In section B for points for your tasks, the maximum (rather
than sum) is taken.

NOTE 2. Task only for students whose student index number ("numer
indeksu") is divisible by 3 with a remainder of 2.

POINTS: 14
DEADLINE: 2019-12-16 23:59
REMAINDER: 2/3