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.