What is the most elegant way to find 16-bit numbers which satisfy some conditions?

Question

I need to find all triples of 16-bit numbers (x, y, z) (well, actually only bits which perfectly match up in different triples with bits on same positions), such that