{"raw_statement":[{"iden":"problem statement","content":"Given are positive integers $N$ and $K$.\nDetermine if the $3N$ integers $K, K+1, ..., K+3N-1$ can be partitioned into $N$ triples $(a_1,b_1,c_1), ..., (a_N,b_N,c_N)$ so that the condition below is satisfied. Any of the integers $K, K+1, ..., K+3N-1$ must appear in exactly one of those triples.\n\n*   For every integer $i$ from $1$ to $N$, $a_i + b_i \\leq c_i$ holds.\n\nIf the answer is yes, construct one such partition."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 10^5$\n*   $1 \\leq K \\leq 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $K$"},{"iden":"sample input 1","content":"1 1"},{"iden":"sample output 1","content":"1 2 3"},{"iden":"sample input 2","content":"3 3"},{"iden":"sample output 2","content":"\\-1"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}