B"Binary Spiders are species of spiders that live on Mars. These spiders weave their webs to defend themselves from enemies. To weave a web, spiders join in pairs. If the first spider in pair has x legs, and the second spider has y legs, then they weave a web with durability x oplus y . Here, oplus means bitwise XOR. Binary Spiders live in large groups. You observe a group of n spiders, and the i -th spider has a_i legs. When the group is threatened, some of the spiders become defenders. Defenders are chosen in the following way. First, there must be at least two defenders. Second, any pair of defenders must be able to weave a web with durability at least k . Third, there must be as much defenders as possible. Scientists have researched the behaviour of Binary Spiders for a long time, and now they have a hypothesis that they can always choose the defenders in an optimal way, satisfying the conditions above. You need to verify this hypothesis on your group of spiders. So, you need to understand how many spiders must become defenders. You are not a Binary Spider, so you decided to use a computer to solve this problem. The first line contains two integers n and k ( 2 <= n <= 3 cdot10^5 , 0 <= k <= 2^{30} - 1 ), the amount of spiders in the group and the minimal allowed durability of a web. The second line contains n integers a_i ( 0 <= a_i <= 2^{30}-1 ) -- the number of legs the i -th spider has. In the first line, print a single integer ell ( 2 <= ell <= n ), the maximum possible amount of defenders. In the second line, print ell integers b_i , separated by a single space ( 1 <= b_i <= n ) -- indices of spiders that will become defenders. If there exists more than one way to choose the defenders, print any of them. Unfortunately, it may appear that it's impossible to choose the defenders. In this case, print a single integer -1 "...