{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eConsider all the sequences with length (0\u0026nbsp;\u0026lt;\u0026nbsp;\u003ci\u003eN\u003c/i\u003e\u0026nbsp;\u0026lt;\u0026nbsp;44), containing only the elements 0 and 1, and no two ones are adjacent (110 is not a valid sequence of length 3, 0101 is a valid sequence of length 4). Write a program which finds the sequence, which is on \u003ci\u003eK\u003c/i\u003e-th place (0\u0026nbsp;\u0026lt;\u0026nbsp;\u003ci\u003eK\u003c/i\u003e\u0026nbsp;\u0026lt;\u0026nbsp;10\u003csup\u003e9\u003c/sup\u003e) in the lexicographically sorted in ascending order collection of the described sequences.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe first line of input contains two positive integers \u003ci\u003eN\u003c/i\u003e and \u003ci\u003eK\u003c/i\u003e.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eWrite the found sequence or −1 if the number \u003ci\u003eK\u003c/i\u003e is larger then the number of valid sequences.\r\n\u003c/div\u003e\u003c/div\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3 1\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e000\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}