Little Artem is a very smart programmer. He knows many different difficult algorithms. Recently he has mastered in 2-SAT one. In computer science, 2-satisfiability (abbreviated as 2-SAT ) is the special case of the problem of determining whether a conjunction (logical AND ) of disjunctions (logical OR ) have a solution, in which all disjunctions consist of no more than two arguments (variables). For the purpose of this problem we consider only 2-SAT formulas where each disjunction consists of exactly two arguments. Consider the following 2-SAT problem as an example: . Note that there might be negations in 2-SAT formula (like for x 1 and for x 4 ). Artem now tries to solve as many problems with 2-SAT as possible. He found a very interesting one, which he can not solve yet. Of course, he asks you to help him. The problem is: given two 2-SAT formulas f and g , determine whether their sets of possible solutions are the same. Otherwise, find any variables assignment x such that f ( x ) ≠ g ( x ) . The first line of the input contains three integers n , m 1 and m 2 ( 1 ≤ n ≤ 1000 , 1 ≤ m 1 , m 2 ≤ n 2 ) — the number of variables, the number of disjunctions in the first formula and the number of disjunctions in the second formula, respectively. Next m 1 lines contains the description of 2-SAT formula f . The description consists of exactly m 1 pairs of integers x i ( - n ≤ x i ≤ n , x i ≠ 0 ) each on separate line, where x i > 0 corresponds to the variable without negation, while x i < 0 corresponds to the variable with negation. Each pair gives a single disjunction. Next m 2 lines contains formula g in the similar format. If both formulas share the same set of solutions, output a single word " SIMILAR " (without quotes). Otherwise output exactly n integers x i ( ) — any set of values x such that f ( x ) ≠ g ( x ) . First sample has two equal formulas, so they are similar by definition. In second sample if we compute first function with x 1 = 0 and x 2 = 0 we get