Potentialy very interesting but with too weak tests problem I got Ac very unexpected on halphway of solution. MY prog can't process test 4 1 2 1 2 1 2 3 4 3 4 3 4 with answer 1 1 1 1 This specific case most interesting case when there are K~100-250 unintersecting circles in given graph. We should build forest consist of such circles and process each tree from the root. Circles are bound throught whome each statement belong. All this situation is unreflected because weak tests.