Find a set of B-bit integers such that:
    the size of the set is at least S AND
    for every pair (x, y) where y!=x, of set elements, w(x^y) >= W.

Here, w(x) is defined as the number of non-zero bits in x.

##</code><code>##

{0xF7D, 0x473, 0x585, 0x3EB, 0x22E, 0xADA, 0xDE0,
 0x906, 0x1FC, 0x310, 0x6D4, 0x01D, 0xF43, 0xA21,
 0xFB6, 0x93B, 0xE8F, 0x448, 0x8E7, 0x6B9, 0x59A}